/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:54:27,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:54:27,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:54:27,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:54:27,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:54:27,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:54:27,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:54:27,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:54:27,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:54:27,897 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:54:27,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:54:27,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:54:27,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:54:27,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:54:27,906 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:54:27,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:54:27,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:54:27,908 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:54:27,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:54:27,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:54:27,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:54:27,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:54:27,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:54:27,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:27,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:54:27,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:54:27,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:54:27,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:54:27,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:54:27,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:54:27,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:54:27,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:54:28,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:54:28,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:54:28,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:54:28,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:54:28,120 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:54:28,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i [2023-12-15 21:54:29,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:54:29,387 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:54:29,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i [2023-12-15 21:54:29,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec2d4bb4/8dcf07d76c8c465da2ca3c4f30c5d661/FLAG9fc804d93 [2023-12-15 21:54:29,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec2d4bb4/8dcf07d76c8c465da2ca3c4f30c5d661 [2023-12-15 21:54:29,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:54:29,408 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:54:29,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:29,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:54:29,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:54:29,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f2df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29, skipping insertion in model container [2023-12-15 21:54:29,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,448 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:54:29,607 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-12-15 21:54:29,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:29,617 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:54:29,669 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-12-15 21:54:29,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:29,695 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:54:29,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29 WrapperNode [2023-12-15 21:54:29,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:29,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:29,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:54:29,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:54:29,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,743 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2023-12-15 21:54:29,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:29,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:54:29,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:54:29,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:54:29,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,766 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 12, 7]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-12-15 21:54:29,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:54:29,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:54:29,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:54:29,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:54:29,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (1/1) ... [2023-12-15 21:54:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:29,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:29,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:54:29,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:54:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-15 21:54:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-15 21:54:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:54:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:54:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:54:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:54:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:54:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:54:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:54:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:54:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 21:54:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:54:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:54:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:54:29,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:54:29,994 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:54:29,996 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:54:30,027 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-15 21:54:30,117 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:54:30,148 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:54:30,148 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-15 21:54:30,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:30 BoogieIcfgContainer [2023-12-15 21:54:30,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:54:30,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:54:30,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:54:30,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:54:30,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:54:29" (1/3) ... [2023-12-15 21:54:30,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@960fea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:30, skipping insertion in model container [2023-12-15 21:54:30,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:29" (2/3) ... [2023-12-15 21:54:30,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@960fea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:30, skipping insertion in model container [2023-12-15 21:54:30,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:30" (3/3) ... [2023-12-15 21:54:30,154 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-12-15 21:54:30,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:54:30,166 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:54:30,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:54:30,202 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1952ebe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:54:30,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:54:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 20 states have (on average 1.65) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:54:30,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:30,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:30,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:30,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1756833671, now seen corresponding path program 1 times [2023-12-15 21:54:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270514560] [2023-12-15 21:54:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:30,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270514560] [2023-12-15 21:54:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270514560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750257035] [2023-12-15 21:54:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:30,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:54:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:54:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:54:30,429 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.65) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:30,464 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2023-12-15 21:54:30,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:54:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:54:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:30,470 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:54:30,470 INFO L226 Difference]: Without dead ends: 16 [2023-12-15 21:54:30,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:54:30,476 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:30,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-15 21:54:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-15 21:54:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2023-12-15 21:54:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-15 21:54:30,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2023-12-15 21:54:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:30,501 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-15 21:54:30,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-15 21:54:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:54:30,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:30,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:30,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:54:30,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:30,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1774937242, now seen corresponding path program 1 times [2023-12-15 21:54:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:30,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943485315] [2023-12-15 21:54:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943485315] [2023-12-15 21:54:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943485315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:30,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:30,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398421015] [2023-12-15 21:54:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:30,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:30,675 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:30,700 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2023-12-15 21:54:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:54:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:30,701 INFO L225 Difference]: With dead ends: 31 [2023-12-15 21:54:30,701 INFO L226 Difference]: Without dead ends: 21 [2023-12-15 21:54:30,701 INFO L412 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 [2023-12-15 21:54:30,702 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:30,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-15 21:54:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2023-12-15 21:54:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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) [2023-12-15 21:54:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-15 21:54:30,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-15 21:54:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:30,712 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-15 21:54:30,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-15 21:54:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:54:30,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:30,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:30,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:54:30,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:30,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1600600636, now seen corresponding path program 1 times [2023-12-15 21:54:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245285917] [2023-12-15 21:54:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:30,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245285917] [2023-12-15 21:54:30,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245285917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:30,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906664387] [2023-12-15 21:54:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:30,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:30,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:30,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:30,820 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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) [2023-12-15 21:54:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:30,847 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-12-15 21:54:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 [2023-12-15 21:54:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:30,848 INFO L225 Difference]: With dead ends: 36 [2023-12-15 21:54:30,848 INFO L226 Difference]: Without dead ends: 21 [2023-12-15 21:54:30,850 INFO L412 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 [2023-12-15 21:54:30,851 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:30,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-15 21:54:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2023-12-15 21:54:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-15 21:54:30,854 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2023-12-15 21:54:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:30,854 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-15 21:54:30,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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) [2023-12-15 21:54:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-15 21:54:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:54:30,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:30,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:30,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:54:30,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:30,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1993302082, now seen corresponding path program 1 times [2023-12-15 21:54:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214327236] [2023-12-15 21:54:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214327236] [2023-12-15 21:54:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214327236] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246754734] [2023-12-15 21:54:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:30,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:30,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:31,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:31,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:54:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:31,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:31,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:31,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246754734] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:31,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-15 21:54:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973660300] [2023-12-15 21:54:31,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:31,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:31,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:31,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:31,253 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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) [2023-12-15 21:54:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:31,291 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-12-15 21:54:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 15 [2023-12-15 21:54:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:31,293 INFO L225 Difference]: With dead ends: 32 [2023-12-15 21:54:31,294 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 21:54:31,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:31,299 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:31,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 21:54:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-15 21:54:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-15 21:54:31,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-12-15 21:54:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:31,304 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-15 21:54:31,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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) [2023-12-15 21:54:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-15 21:54:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:54:31,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:31,305 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:31,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:31,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:31,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:31,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1400384740, now seen corresponding path program 1 times [2023-12-15 21:54:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:31,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770329954] [2023-12-15 21:54:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:54:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770329954] [2023-12-15 21:54:32,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770329954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:32,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:54:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135193810] [2023-12-15 21:54:32,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:32,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:54:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:32,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:54:32,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:54:32,189 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:32,308 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-15 21:54:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:54:32,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 21:54:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:32,314 INFO L225 Difference]: With dead ends: 29 [2023-12-15 21:54:32,314 INFO L226 Difference]: Without dead ends: 27 [2023-12-15 21:54:32,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:54:32,315 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:32,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:54:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-15 21:54:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-12-15 21:54:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-15 21:54:32,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2023-12-15 21:54:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:32,320 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-15 21:54:32,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-15 21:54:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:54:32,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:32,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:54:32,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:32,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1400383066, now seen corresponding path program 1 times [2023-12-15 21:54:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:32,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077338446] [2023-12-15 21:54:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077338446] [2023-12-15 21:54:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077338446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:32,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:54:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565216986] [2023-12-15 21:54:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:32,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:32,468 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2023-12-15 21:54:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:32,496 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-12-15 21:54:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:32,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 20 [2023-12-15 21:54:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:32,497 INFO L225 Difference]: With dead ends: 27 [2023-12-15 21:54:32,497 INFO L226 Difference]: Without dead ends: 24 [2023-12-15 21:54:32,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:32,497 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:32,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-15 21:54:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-15 21:54:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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) [2023-12-15 21:54:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-15 21:54:32,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 20 [2023-12-15 21:54:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:32,506 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-15 21:54:32,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2023-12-15 21:54:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-15 21:54:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 21:54:32,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:32,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:32,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:54:32,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:32,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1445006367, now seen corresponding path program 1 times [2023-12-15 21:54:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980434069] [2023-12-15 21:54:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:33,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980434069] [2023-12-15 21:54:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980434069] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285540107] [2023-12-15 21:54:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:33,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:33,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:33,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:54:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:33,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 103 conjunts are in the unsatisfiable core [2023-12-15 21:54:33,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:33,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:54:33,746 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:54:33,746 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 17 treesize of output 21 [2023-12-15 21:54:33,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-12-15 21:54:33,869 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 16 treesize of output 11 [2023-12-15 21:54:34,033 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-15 21:54:34,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-15 21:54:34,154 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 20 treesize of output 15 [2023-12-15 21:54:34,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-12-15 21:54:34,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:34,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-12-15 21:54:34,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:34,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2023-12-15 21:54:34,266 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:34,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:34,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2023-12-15 21:54:34,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:34,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2023-12-15 21:54:34,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-15 21:54:34,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-12-15 21:54:34,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:54:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:34,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:34,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:34,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 403 treesize of output 370 [2023-12-15 21:54:34,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 683 treesize of output 653 [2023-12-15 21:54:34,889 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 618 treesize of output 586 [2023-12-15 21:54:34,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:34,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 509 [2023-12-15 21:54:34,918 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 476 treesize of output 460 [2023-12-15 21:54:34,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:34,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 882 treesize of output 792 [2023-12-15 21:54:35,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 351 [2023-12-15 21:54:35,010 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 351 treesize of output 319 [2023-12-15 21:54:37,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse135 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse132 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse61 (select .cse132 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse131 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse135 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (select .cse135 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse38 (= .cse131 .cse28)) (.cse29 (+ .cse61 8)) (.cse34 (= .cse28 0))) (let ((.cse37 (and (not (= .cse131 0)) .cse34)) (.cse25 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse134 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse134 .cse28 (store (select .cse134 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_20) v_arrayElimCell_25)) (= v_arrayElimCell_25 0)))) (.cse24 (not .cse38)) (.cse32 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (or (= v_arrayElimCell_19 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse133 .cse28 (store (select .cse133 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_19) v_arrayElimCell_24))))) (.cse93 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse132 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (= (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) .cse93)) (.cse21 (= .cse131 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse0 (forall ((v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse129 (let ((.cse130 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse130 .cse28 (store (select .cse130 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse129 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse129 v_arrayElimCell_19) v_arrayElimCell_24))))))) (= v_arrayElimCell_16 0)))) (.cse1 (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse128 .cse28 (store (select .cse128 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_16) v_arrayElimCell_21)) (= v_arrayElimCell_21 0))) .cse38)) (.cse14 (or .cse24 (and .cse32 (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse126 (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse127 .cse28 (store (select .cse127 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 v_arrayElimCell_19) v_arrayElimCell_24))))) (= v_arrayElimCell_19 0)))))) (.cse2 (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse124 (let ((.cse125 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse125 .cse28 (store (select .cse125 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse124 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse124 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse3 (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse122 (store (select .cse123 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse122 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse123 .cse28 .cse122) v_arrayElimCell_20) v_arrayElimCell_25)))))) (= v_arrayElimCell_25 0)))))) (.cse4 (or .cse38 (and (forall ((v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse119 (let ((.cse120 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse120 .cse28 (store (select .cse120 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_arrayElimCell_19) v_arrayElimCell_24))))) (= v_arrayElimCell_16 0))) (forall ((v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse121 .cse28 (store (select .cse121 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) v_arrayElimCell_21))) (= v_arrayElimCell_16 0)))))) (.cse6 (or .cse24 (and .cse32 (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse117 (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse118 .cse28 (store (select .cse118 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse117 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse117 v_arrayElimCell_19) v_arrayElimCell_24)))))))))) (.cse7 (or .cse38 (and (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse116 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse115 (store (select .cse116 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse116 .cse28 .cse115) v_arrayElimCell_20) v_arrayElimCell_25)))))))) (forall ((v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_prenex_3) v_arrayElimCell_21))) (= v_arrayElimCell_21 0)))))) (.cse8 (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_prenex_3) v_arrayElimCell_21)) (= v_arrayElimCell_21 0))) .cse38)) (.cse15 (or .cse38 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse114 .cse28 (store (select .cse114 .cse28) .cse29 v_prenex_3))) 0) v_arrayElimCell_21)))))) (.cse9 (or (and .cse25 (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse113 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse112 (store (select .cse113 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse112 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse113 .cse28 .cse112) v_arrayElimCell_20) v_arrayElimCell_25)))))) (= v_arrayElimCell_25 0)))) .cse24)) (.cse16 (or (and (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse109 .cse28 (store (select .cse109 .cse28) .cse29 v_prenex_3))) 0) v_arrayElimCell_21))))) (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse110 (let ((.cse111 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse111 .cse28 (store (select .cse111 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse110 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse110 v_arrayElimCell_20) v_arrayElimCell_25)))))))) .cse38)) (.cse10 (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse107 (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse108 .cse28 (store (select .cse108 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse12 (or (and (forall ((v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse104 .cse28 (store (select .cse104 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_16) v_arrayElimCell_21))) (= v_arrayElimCell_21 0))) (forall ((v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_20 Int)) (let ((.cse105 (let ((.cse106 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse106 .cse28 (store (select .cse106 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse105 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse105 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_21 0)))) .cse38)) (.cse17 (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse102 (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse103 .cse28 (store (select .cse103 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse102 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse102 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse18 (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse100 (let ((.cse101 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse101 .cse28 (store (select .cse101 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse100 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse100 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse19 (or .cse38 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int) (v_ArrVal_556 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse99 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse99 .cse28 (store (select .cse99 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) v_arrayElimCell_21)) (= v_arrayElimCell_16 0))))) (.cse20 (or .cse37 (let ((.cse94 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_ArrVal_556) v_arrayElimCell_21))))) (and (or (and .cse94 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_arrayElimCell_21 Int) (v_ArrVal_556 Int)) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse96 (store (select .cse95 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse95 .cse28 .cse96) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 v_arrayElimCell_21))))))) .cse38) (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse98 (store (select .cse97 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse97 .cse28 .cse98) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse98 v_arrayElimCell_21)))))) (= v_arrayElimCell_19 0))) (or .cse94 .cse38))))) (.cse13 (= .cse93 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse11 (or .cse24 .cse32)) (.cse5 (or .cse24 .cse25)) (.cse22 (= .cse61 0))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18)) .cse19 .cse20) .cse21) (or (and .cse13 .cse21 (not .cse22)) (let ((.cse23 (and (or (and (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse45 .cse28 (store (select .cse45 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_16) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0))) .cse25) .cse24) (or .cse38 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_556 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse46 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse46 .cse28 (store (select .cse46 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) 0)) (= v_arrayElimCell_16 0)))) .cse11 (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse47 (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse48 .cse28 (store (select .cse48 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_16) 0))))))) (= v_arrayElimCell_16 0))) (or .cse38 (and (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse49 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse49 .cse28 (store (select .cse49 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) 0))) (= v_arrayElimCell_16 0))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse50 (let ((.cse51 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse51 .cse28 (store (select .cse51 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_16) 0))))) (= v_arrayElimCell_16 0))))) (or .cse24 (and (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse52 (let ((.cse53 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse53 .cse28 (store (select .cse53 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_16) 0))))))) .cse32))))) (and (or .cse21 .cse23) (or .cse13 (and (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse26 (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 0) 0))))) (= v_arrayElimCell_25 0))))) (or .cse24 (and (forall ((v_arrayElimCell_19 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse30 (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse31 .cse28 (store (select .cse31 .cse28) .cse29 v_ArrVal_556))))) (or (= (select (select .cse30 0) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_arrayElimCell_19) v_arrayElimCell_24))))) (= v_arrayElimCell_19 0))) .cse32)) (or .cse33 .cse23))) (or (and .cse33 .cse21 (not .cse34)) (and (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse35 (store (select .cse36 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse36 .cse28 .cse35) v_arrayElimCell_20) v_arrayElimCell_25)))))) (= v_arrayElimCell_25 0))))) (or .cse37 (let ((.cse39 (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_ArrVal_556) 0))))) (and (or .cse38 .cse39) .cse11 (or (and (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse40 (store (select .cse41 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse41 .cse28 .cse40) v_arrayElimCell_19) v_arrayElimCell_24)))))) .cse39) .cse38) (forall ((v_arrayElimCell_19 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse43 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse42 (store (select .cse43 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse43 .cse28 .cse42) v_arrayElimCell_19) v_arrayElimCell_24)))))) (= v_arrayElimCell_19 0))))))))))) (or .cse33 (let ((.cse66 (and .cse24 .cse22)) (.cse62 (forall ((v_ArrVal_548 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse61))))) (let ((.cse63 (or .cse38 .cse62)) (.cse54 (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse91 (let ((.cse92 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse92 .cse28 (store (select .cse92 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse91 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse91 v_arrayElimCell_16) .cse61))))))) (= v_arrayElimCell_16 0)))) (.cse55 (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_556 Int)) (or (= v_arrayElimCell_16 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse90 .cse28 (store (select .cse90 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) .cse61)))) .cse38)) (.cse56 (or (let ((.cse84 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_16 Int)) (= (select (select (let ((.cse89 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse89 .cse28 (store (select .cse89 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_16) .cse61) |c_ULTIMATE.start_main_~data~0#1|)))) (and .cse5 (or .cse38 .cse84) (or .cse38 (and (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_20 Int)) (let ((.cse85 (let ((.cse86 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse86 .cse28 (store (select .cse86 .cse28) .cse29 v_prenex_3))))) (or (= (select (select .cse85 v_arrayElimCell_16) .cse61) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse85 v_arrayElimCell_20) v_arrayElimCell_25))))) .cse84)) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse87 (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse88 .cse28 (store (select .cse88 .cse28) .cse29 v_prenex_3))))) (or (= (select (select .cse87 v_arrayElimCell_16) .cse61) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse87 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0))))) .cse66)) (.cse57 (or .cse24 (and (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse82 (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse83 .cse28 (store (select .cse83 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse82 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse82 v_arrayElimCell_16) .cse61))))))) .cse32))) (.cse58 (or .cse38 (and (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse79 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse79 .cse28 (store (select .cse79 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) .cse61))) (= v_arrayElimCell_16 0))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse80 (let ((.cse81 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse81 .cse28 (store (select .cse81 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_arrayElimCell_16) .cse61))))) (= v_arrayElimCell_16 0))))))) (and (or (and .cse54 .cse55 .cse11 .cse56 .cse57 .cse58) .cse21) (or (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse10 .cse11 .cse12 .cse17 .cse18 .cse19 .cse20) .cse13) (or (and (or (and (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse59 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse60 (select .cse59 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse59 .cse28 (store .cse60 .cse29 v_prenex_3)) v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse61)))))) .cse62) .cse38) .cse5 .cse63 (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse64 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse65 (select .cse64 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse64 .cse28 (store .cse65 .cse29 v_prenex_3)) v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse61)))))) (= v_arrayElimCell_25 0)))) .cse66) (or .cse37 (and (or (and (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse68 (select .cse67 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse67 .cse28 (store .cse68 .cse29 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 .cse61)))))) .cse62) .cse38) .cse11 .cse63 (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse70 (select .cse69 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse69 .cse28 (store .cse70 .cse29 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 .cse61)))))))))) (or .cse13 (and .cse54 .cse55 .cse11 .cse56 .cse57 (or .cse66 (let ((.cse73 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse76 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse76 .cse28 (store (select .cse76 .cse28) .cse29 v_prenex_3))) 0) .cse61))))) (and (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse71 (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse72 .cse28 (store (select .cse72 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 0) .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0))) (or (and .cse73 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse74 (let ((.cse75 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse75 .cse28 (store (select .cse75 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse74 0) .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse74 v_arrayElimCell_20) v_arrayElimCell_25)))))) .cse38) .cse5 (or .cse38 .cse73)))) (or .cse24 (and (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse77 (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse78 .cse28 (store (select .cse78 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 0) .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 v_arrayElimCell_19) v_arrayElimCell_24))))))) .cse32)) .cse58)))))))))))) is different from false [2023-12-15 21:54:41,638 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse135 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse132 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse61 (select .cse132 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse131 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse135 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (select .cse135 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse38 (= .cse131 .cse28)) (.cse29 (+ .cse61 8)) (.cse34 (= .cse28 0))) (let ((.cse37 (and (not (= .cse131 0)) .cse34)) (.cse25 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse134 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse134 .cse28 (store (select .cse134 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_20) v_arrayElimCell_25)) (= v_arrayElimCell_25 0)))) (.cse24 (not .cse38)) (.cse32 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (or (= v_arrayElimCell_19 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse133 .cse28 (store (select .cse133 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_19) v_arrayElimCell_24))))) (.cse93 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse132 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (= (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) .cse93)) (.cse21 (= .cse131 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse0 (forall ((v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse129 (let ((.cse130 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse130 .cse28 (store (select .cse130 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse129 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse129 v_arrayElimCell_19) v_arrayElimCell_24))))))) (= v_arrayElimCell_16 0)))) (.cse1 (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse128 .cse28 (store (select .cse128 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_16) v_arrayElimCell_21)) (= v_arrayElimCell_21 0))) .cse38)) (.cse14 (or .cse24 (and .cse32 (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse126 (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse127 .cse28 (store (select .cse127 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse126 v_arrayElimCell_19) v_arrayElimCell_24))))) (= v_arrayElimCell_19 0)))))) (.cse2 (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse124 (let ((.cse125 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse125 .cse28 (store (select .cse125 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse124 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse124 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse3 (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse122 (store (select .cse123 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse122 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse123 .cse28 .cse122) v_arrayElimCell_20) v_arrayElimCell_25)))))) (= v_arrayElimCell_25 0)))))) (.cse4 (or .cse38 (and (forall ((v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse119 (let ((.cse120 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse120 .cse28 (store (select .cse120 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse119 v_arrayElimCell_19) v_arrayElimCell_24))))) (= v_arrayElimCell_16 0))) (forall ((v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse121 .cse28 (store (select .cse121 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) v_arrayElimCell_21))) (= v_arrayElimCell_16 0)))))) (.cse6 (or .cse24 (and .cse32 (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse117 (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse118 .cse28 (store (select .cse118 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse117 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse117 v_arrayElimCell_19) v_arrayElimCell_24)))))))))) (.cse7 (or .cse38 (and (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse116 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse115 (store (select .cse116 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse116 .cse28 .cse115) v_arrayElimCell_20) v_arrayElimCell_25)))))))) (forall ((v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_prenex_3) v_arrayElimCell_21))) (= v_arrayElimCell_21 0)))))) (.cse8 (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_prenex_3) v_arrayElimCell_21)) (= v_arrayElimCell_21 0))) .cse38)) (.cse15 (or .cse38 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse114 .cse28 (store (select .cse114 .cse28) .cse29 v_prenex_3))) 0) v_arrayElimCell_21)))))) (.cse9 (or (and .cse25 (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse113 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse112 (store (select .cse113 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse112 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse113 .cse28 .cse112) v_arrayElimCell_20) v_arrayElimCell_25)))))) (= v_arrayElimCell_25 0)))) .cse24)) (.cse16 (or (and (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse109 .cse28 (store (select .cse109 .cse28) .cse29 v_prenex_3))) 0) v_arrayElimCell_21))))) (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse110 (let ((.cse111 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse111 .cse28 (store (select .cse111 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse110 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse110 v_arrayElimCell_20) v_arrayElimCell_25)))))))) .cse38)) (.cse10 (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse107 (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse108 .cse28 (store (select .cse108 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse107 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse12 (or (and (forall ((v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse104 .cse28 (store (select .cse104 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_16) v_arrayElimCell_21))) (= v_arrayElimCell_21 0))) (forall ((v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_20 Int)) (let ((.cse105 (let ((.cse106 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse106 .cse28 (store (select .cse106 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse105 v_arrayElimCell_16) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse105 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_21 0)))) .cse38)) (.cse17 (forall ((v_arrayElimCell_21 Int)) (or (= v_arrayElimCell_21 0) (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse102 (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse103 .cse28 (store (select .cse103 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse102 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse102 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse18 (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse100 (let ((.cse101 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse101 .cse28 (store (select .cse101 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse100 0) v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse100 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0)))))) (.cse19 (or .cse38 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_16 Int) (v_arrayElimCell_21 Int) (v_ArrVal_556 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse99 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse99 .cse28 (store (select .cse99 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) v_arrayElimCell_21)) (= v_arrayElimCell_16 0))))) (.cse20 (or .cse37 (let ((.cse94 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_ArrVal_556) v_arrayElimCell_21))))) (and (or (and .cse94 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_arrayElimCell_21 Int) (v_ArrVal_556 Int)) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse96 (store (select .cse95 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse95 .cse28 .cse96) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 v_arrayElimCell_21))))))) .cse38) (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse98 (store (select .cse97 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse97 .cse28 .cse98) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse98 v_arrayElimCell_21)))))) (= v_arrayElimCell_19 0))) (or .cse94 .cse38))))) (.cse13 (= .cse93 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse11 (or .cse24 .cse32)) (.cse5 (or .cse24 .cse25)) (.cse22 (= .cse61 0))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18)) .cse19 .cse20) .cse21) (or (and .cse13 .cse21 (not .cse22)) (let ((.cse23 (and (or (and (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse45 .cse28 (store (select .cse45 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_16) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0))) .cse25) .cse24) (or .cse38 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_556 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse46 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse46 .cse28 (store (select .cse46 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) 0)) (= v_arrayElimCell_16 0)))) .cse11 (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse47 (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse48 .cse28 (store (select .cse48 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_16) 0))))))) (= v_arrayElimCell_16 0))) (or .cse38 (and (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse49 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse49 .cse28 (store (select .cse49 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) 0))) (= v_arrayElimCell_16 0))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse50 (let ((.cse51 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse51 .cse28 (store (select .cse51 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_16) 0))))) (= v_arrayElimCell_16 0))))) (or .cse24 (and (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse52 (let ((.cse53 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse53 .cse28 (store (select .cse53 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_16) 0))))))) .cse32))))) (and (or .cse21 .cse23) (or .cse13 (and (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse26 (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 0) 0))))) (= v_arrayElimCell_25 0))))) (or .cse24 (and (forall ((v_arrayElimCell_19 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse30 (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse31 .cse28 (store (select .cse31 .cse28) .cse29 v_ArrVal_556))))) (or (= (select (select .cse30 0) 0) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_arrayElimCell_19) v_arrayElimCell_24))))) (= v_arrayElimCell_19 0))) .cse32)) (or .cse33 .cse23))) (or (and .cse33 .cse21 (not .cse34)) (and (or .cse24 (and .cse25 (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse35 (store (select .cse36 .cse28) .cse29 v_prenex_3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse36 .cse28 .cse35) v_arrayElimCell_20) v_arrayElimCell_25)))))) (= v_arrayElimCell_25 0))))) (or .cse37 (let ((.cse39 (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse29 v_ArrVal_556) 0))))) (and (or .cse38 .cse39) .cse11 (or (and (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse40 (store (select .cse41 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse41 .cse28 .cse40) v_arrayElimCell_19) v_arrayElimCell_24)))))) .cse39) .cse38) (forall ((v_arrayElimCell_19 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse43 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse42 (store (select .cse43 .cse28) .cse29 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse43 .cse28 .cse42) v_arrayElimCell_19) v_arrayElimCell_24)))))) (= v_arrayElimCell_19 0))))))))))) (or .cse33 (let ((.cse66 (and .cse24 .cse22)) (.cse62 (forall ((v_ArrVal_548 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548) .cse28) .cse61))))) (let ((.cse63 (or .cse38 .cse62)) (.cse54 (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse91 (let ((.cse92 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse92 .cse28 (store (select .cse92 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse91 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse91 v_arrayElimCell_16) .cse61))))))) (= v_arrayElimCell_16 0)))) (.cse55 (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_556 Int)) (or (= v_arrayElimCell_16 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse90 .cse28 (store (select .cse90 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) .cse61)))) .cse38)) (.cse56 (or (let ((.cse84 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_16 Int)) (= (select (select (let ((.cse89 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse89 .cse28 (store (select .cse89 .cse28) .cse29 v_prenex_3))) v_arrayElimCell_16) .cse61) |c_ULTIMATE.start_main_~data~0#1|)))) (and .cse5 (or .cse38 .cse84) (or .cse38 (and (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int) (v_arrayElimCell_20 Int)) (let ((.cse85 (let ((.cse86 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse86 .cse28 (store (select .cse86 .cse28) .cse29 v_prenex_3))))) (or (= (select (select .cse85 v_arrayElimCell_16) .cse61) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse85 v_arrayElimCell_20) v_arrayElimCell_25))))) .cse84)) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse87 (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse88 .cse28 (store (select .cse88 .cse28) .cse29 v_prenex_3))))) (or (= (select (select .cse87 v_arrayElimCell_16) .cse61) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse87 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0))))) .cse66)) (.cse57 (or .cse24 (and (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_16 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse82 (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse83 .cse28 (store (select .cse83 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse82 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse82 v_arrayElimCell_16) .cse61))))))) .cse32))) (.cse58 (or .cse38 (and (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse79 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse79 .cse28 (store (select .cse79 .cse28) .cse29 v_ArrVal_556))) v_arrayElimCell_16) .cse61))) (= v_arrayElimCell_16 0))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse80 (let ((.cse81 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse81 .cse28 (store (select .cse81 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse80 v_arrayElimCell_16) .cse61))))) (= v_arrayElimCell_16 0))))))) (and (or (and .cse54 .cse55 .cse11 .cse56 .cse57 .cse58) .cse21) (or (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse10 .cse11 .cse12 .cse17 .cse18 .cse19 .cse20) .cse13) (or (and (or (and (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse59 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse60 (select .cse59 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse59 .cse28 (store .cse60 .cse29 v_prenex_3)) v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse61)))))) .cse62) .cse38) .cse5 .cse63 (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse64 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse65 (select .cse64 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse64 .cse28 (store .cse65 .cse29 v_prenex_3)) v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse61)))))) (= v_arrayElimCell_25 0)))) .cse66) (or .cse37 (and (or (and (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse68 (select .cse67 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse67 .cse28 (store .cse68 .cse29 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 .cse61)))))) .cse62) .cse38) .cse11 .cse63 (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (let ((.cse70 (select .cse69 .cse28))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse69 .cse28 (store .cse70 .cse29 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 .cse61)))))))))) (or .cse13 (and .cse54 .cse55 .cse11 .cse56 .cse57 (or .cse66 (let ((.cse73 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse76 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse76 .cse28 (store (select .cse76 .cse28) .cse29 v_prenex_3))) 0) .cse61))))) (and (forall ((v_arrayElimCell_25 Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_20 Int)) (let ((.cse71 (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse72 .cse28 (store (select .cse72 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 0) .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_20) v_arrayElimCell_25))))) (= v_arrayElimCell_25 0))) (or (and .cse73 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_20 Int)) (let ((.cse74 (let ((.cse75 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse75 .cse28 (store (select .cse75 .cse28) .cse29 v_prenex_3))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse74 0) .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse74 v_arrayElimCell_20) v_arrayElimCell_25)))))) .cse38) .cse5 (or .cse38 .cse73)))) (or .cse24 (and (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 0) (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse77 (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_548))) (store .cse78 .cse28 (store (select .cse78 .cse28) .cse29 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 0) .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse77 v_arrayElimCell_19) v_arrayElimCell_24))))))) .cse32)) .cse58)))))))))))) is different from true [2023-12-15 21:54:44,500 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 755 treesize of output 559 [2023-12-15 21:54:44,516 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 563 treesize of output 495 [2023-12-15 21:54:44,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2023-12-15 21:54:44,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-12-15 21:54:44,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-12-15 21:54:44,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-12-15 21:54:44,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-12-15 21:54:44,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-12-15 21:54:44,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:44,976 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2023-12-15 21:54:47,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse16 (not (= (select |c_#valid| 0) 0))) (.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse3 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse5 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (and (or (and (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)) (forall ((v_ArrVal_548 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (forall ((v_prenex_3 Int) (v_arrayElimCell_25 Int) (v_prenex_4 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_3)) v_arrayElimCell_20) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0))))) .cse3) (or .cse4 (and (or (forall ((v_ArrVal_546 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_37 Int) (v_prenex_36 Int)) (or (= v_prenex_36 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_5) v_prenex_36) v_prenex_37)))) .cse5) (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)) (forall ((v_prenex_34 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_34) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (forall ((v_prenex_33 Int) (v_prenex_32 Int) (v_prenex_31 Int) (v_prenex_29 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_29))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse2 v_prenex_33)) v_prenex_31) v_prenex_32)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)))) (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)) (forall ((v_prenex_30 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_30) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|)))) (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (forall ((v_prenex_45 Int) (v_prenex_46 Int) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_44))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_45 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 .cse2 v_prenex_43)) v_prenex_45) v_prenex_46)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)))))) (or .cse3 (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse11 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_9))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= v_prenex_11 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse2 v_prenex_10)) v_prenex_12) v_prenex_11)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0))))))) (or (and (or .cse4 (and (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_33 Int) (v_prenex_32 Int) (v_prenex_31 Int) (v_prenex_29 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_29))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse13 .cse2 v_prenex_33)) v_prenex_31) v_prenex_32)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_30 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_30) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_45 Int) (v_prenex_46 Int) (v_prenex_43 Int) (v_prenex_44 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_44))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= v_prenex_45 0) (= (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse2 v_prenex_43)) v_prenex_45) v_prenex_46)))))) (or .cse4 (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_34 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_34) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (or (not .cse4) (forall ((v_ArrVal_546 (Array Int Int)) (v_arrayElimArr_6 (Array Int Int)) (v_prenex_37 Int) (v_prenex_36 Int)) (or (= v_prenex_36 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_arrayElimArr_6) v_prenex_36) v_prenex_37)))))) .cse16) (or (and (or (and (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_41 Int) (v_prenex_42 Int) (v_arrayElimArr_9 (Array Int Int))) (or (= v_prenex_41 0) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_9 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_9) v_prenex_42) v_prenex_41)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_27 Int) (v_prenex_26 Int) (v_arrayElimArr_8 (Array Int Int))) (or (= v_prenex_26 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_8) v_prenex_27) v_prenex_26))))) .cse5) (or .cse4 (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int) (v_prenex_23 Int) (v_prenex_20 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_20))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse17 8 v_prenex_23)) v_prenex_21) v_prenex_22)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)) (= v_prenex_21 0)))))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_23 Int) (v_prenex_20 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_20))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse19 8 v_prenex_23)) v_prenex_21) v_prenex_22)) (= v_prenex_21 0))))) .cse16) (or .cse4 (and (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_39) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (forall ((v_ArrVal_546 (Array Int Int)) (v_arrayElimCell_19 Int) (v_prenex_14 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_14))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse22 8 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_24)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 0))))))) .cse16) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_16 Int) (v_arrayElimArr_7 (Array Int Int)) (v_prenex_17 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7) v_prenex_16) v_prenex_17)) (= v_prenex_16 0))) .cse5) (or .cse4 (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_19 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) 0 v_prenex_19) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) .cse16) (or .cse4 (and (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_14 (Array Int Int)) (v_arrayElimCell_24 Int) (v_ArrVal_556 Int)) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_14))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 8 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_24)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)))) (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (forall ((v_prenex_39 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_39) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)))))) (or .cse4 (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int) (v_prenex_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_19) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0)))))) (not .cse3)) (or .cse5 (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_8 Int)) (or (= v_prenex_7 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4) v_prenex_8) v_prenex_7))))) (or .cse3 (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int) (v_prenex_13 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_prenex_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) 0))))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_arrayElimArr_3 (Array Int Int))) (or (= v_prenex_11 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3) v_prenex_12) v_prenex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) .cse5))) is different from false [2023-12-15 21:54:52,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:52,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 25654 treesize of output 26654 [2023-12-15 21:54:53,314 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 3643 treesize of output 3635 [2023-12-15 21:54:53,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:53,786 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 3675 treesize of output 3670 [2023-12-15 21:54:55,225 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 3861 treesize of output 3859 [2023-12-15 21:54:55,621 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 3859 treesize of output 3857 [2023-12-15 21:54:56,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:56,119 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 3877 treesize of output 3874 [2023-12-15 21:54:56,517 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 3865 treesize of output 3861 [2023-12-15 21:54:56,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:56,948 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 3881 treesize of output 3880 [2023-12-15 21:54:57,349 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 3871 treesize of output 3863 [2023-12-15 21:54:57,745 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 3863 treesize of output 3861 [2023-12-15 21:54:58,152 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 3861 treesize of output 3859 [2023-12-15 21:54:58,561 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 3859 treesize of output 3855 [2023-12-15 21:54:58,958 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 3855 treesize of output 3853 [2023-12-15 21:54:59,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:59,389 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 3933 treesize of output 3918 [2023-12-15 21:54:59,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:59,827 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 3949 treesize of output 3946 [2023-12-15 21:55:00,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:00,294 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 3937 treesize of output 3940 [2023-12-15 21:55:00,720 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 3931 treesize of output 3929 [2023-12-15 21:55:01,151 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 3929 treesize of output 3925 [2023-12-15 21:55:01,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3925 treesize of output 3923 [2023-12-15 21:55:02,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:02,065 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 3971 treesize of output 3968 [2023-12-15 21:55:02,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:02,561 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 4007 treesize of output 4002 [2023-12-15 21:55:03,049 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 3993 treesize of output 3991 [2023-12-15 21:55:03,515 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 3991 treesize of output 3983 [2023-12-15 21:55:03,984 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 3983 treesize of output 3981 [2023-12-15 21:55:04,449 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 3981 treesize of output 3979 [2023-12-15 21:55:04,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:04,949 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 3979 treesize of output 3982 [2023-12-15 21:55:05,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:05,464 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 4069 treesize of output 4054 [2023-12-15 21:55:05,974 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 4045 treesize of output 4043 [2023-12-15 21:55:06,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:06,499 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 4079 treesize of output 4078 [2023-12-15 21:55:06,986 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 4069 treesize of output 4063 [2023-12-15 21:55:07,473 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 4063 treesize of output 4059 [2023-12-15 21:55:07,963 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 4059 treesize of output 4057 [2023-12-15 21:55:08,457 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 4057 treesize of output 4055 [2023-12-15 21:55:08,946 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 4055 treesize of output 4053 [2023-12-15 21:55:09,436 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 4053 treesize of output 4049 [2023-12-15 21:55:09,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:09,965 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 4097 treesize of output 4094 [2023-12-15 21:55:10,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:10,488 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 4133 treesize of output 4130 [2023-12-15 21:55:11,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:11,026 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 4217 treesize of output 4202 [2023-12-15 21:55:11,547 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 4193 treesize of output 4191 [2023-12-15 21:55:12,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:12,125 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 4215 treesize of output 4216 [2023-12-15 21:55:12,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:12,743 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 4255 treesize of output 4252 [2023-12-15 21:55:13,277 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 4243 treesize of output 4241 [2023-12-15 21:55:13,813 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 4241 treesize of output 4239 [2023-12-15 21:55:14,370 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 4239 treesize of output 4235 Received shutdown request... [2023-12-15 21:55:39,130 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:55:39,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:55:39,168 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:55:39,170 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:55:39,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-15 21:55:39,336 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-183-5-6-6-3-5-3-4-3-6-2-2-2-1 context. [2023-12-15 21:55:39,339 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:39,341 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:55:39,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:55:39 BoogieIcfgContainer [2023-12-15 21:55:39,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:55:39,344 INFO L158 Benchmark]: Toolchain (without parser) took 69936.45ms. Allocated memory was 291.5MB in the beginning and 828.4MB in the end (delta: 536.9MB). Free memory was 227.5MB in the beginning and 704.5MB in the end (delta: -477.0MB). Peak memory consumption was 477.7MB. Max. memory is 8.0GB. [2023-12-15 21:55:39,344 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:55:39,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.23ms. Allocated memory is still 291.5MB. Free memory was 227.0MB in the beginning and 209.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:55:39,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.06ms. Allocated memory is still 291.5MB. Free memory was 209.1MB in the beginning and 207.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:39,345 INFO L158 Benchmark]: Boogie Preprocessor took 52.76ms. Allocated memory is still 291.5MB. Free memory was 207.0MB in the beginning and 203.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:39,345 INFO L158 Benchmark]: RCFGBuilder took 350.55ms. Allocated memory is still 291.5MB. Free memory was 203.9MB in the beginning and 184.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 21:55:39,345 INFO L158 Benchmark]: TraceAbstraction took 69193.60ms. Allocated memory was 291.5MB in the beginning and 828.4MB in the end (delta: 536.9MB). Free memory was 184.0MB in the beginning and 704.5MB in the end (delta: -520.5MB). Peak memory consumption was 433.6MB. Max. memory is 8.0GB. [2023-12-15 21:55:39,346 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.23ms. Allocated memory is still 291.5MB. Free memory was 227.0MB in the beginning and 209.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.06ms. Allocated memory is still 291.5MB. Free memory was 209.1MB in the beginning and 207.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.76ms. Allocated memory is still 291.5MB. Free memory was 207.0MB in the beginning and 203.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.55ms. Allocated memory is still 291.5MB. Free memory was 203.9MB in the beginning and 184.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 69193.60ms. Allocated memory was 291.5MB in the beginning and 828.4MB in the end (delta: 536.9MB). Free memory was 184.0MB in the beginning and 704.5MB in the end (delta: -520.5MB). Peak memory consumption was 433.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 638). Cancelled while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-183-5-6-6-3-5-3-4-3-6-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 88 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 2 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 15/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown