/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/sll2n_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 17:12:51,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 17:12:51,884 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-19 17:12:51,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 17:12:51,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 17:12:51,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 17:12:51,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 17:12:51,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 17:12:51,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 17:12:51,914 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 17:12:51,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 17:12:51,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 17:12:51,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 17:12:51,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 17:12:51,916 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 17:12:51,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 17:12:51,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 17:12:51,916 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 17:12:51,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 17:12:51,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 17:12:51,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 17:12:51,918 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 17:12:51,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 17:12:51,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:12:51,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 17:12:51,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 17:12:51,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 17:12:51,921 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 17:12:51,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 17:12:51,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 17:12:51,921 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-19 17:12:52,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 17:12:52,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 17:12:52,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 17:12:52,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 17:12:52,139 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 17:12:52,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.i [2023-12-19 17:12:53,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 17:12:53,344 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 17:12:53,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.i [2023-12-19 17:12:53,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21247134b/55132a4ef7ae4165ad25dd509915c955/FLAG63e3c07fc [2023-12-19 17:12:53,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21247134b/55132a4ef7ae4165ad25dd509915c955 [2023-12-19 17:12:53,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 17:12:53,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 17:12:53,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 17:12:53,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 17:12:53,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 17:12:53,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f213e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53, skipping insertion in model container [2023-12-19 17:12:53,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 17:12:53,618 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/sll2n_append_equal.i[24197,24210] [2023-12-19 17:12:53,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:12:53,641 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 17:12:53,680 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/sll2n_append_equal.i[24197,24210] [2023-12-19 17:12:53,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:12:53,704 INFO L206 MainTranslator]: Completed translation [2023-12-19 17:12:53,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53 WrapperNode [2023-12-19 17:12:53,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 17:12:53,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 17:12:53,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 17:12:53,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 17:12:53,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,763 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-12-19 17:12:53,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 17:12:53,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 17:12:53,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 17:12:53,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 17:12:53,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,803 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2023-12-19 17:12:53,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 17:12:53,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 17:12:53,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 17:12:53,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 17:12:53,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (1/1) ... [2023-12-19 17:12:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:12:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:12:53,852 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-19 17:12:53,859 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-19 17:12:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 17:12:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 17:12:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 17:12:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 17:12:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 17:12:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 17:12:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-19 17:12:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-19 17:12:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 17:12:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 17:12:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 17:12:54,000 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 17:12:54,002 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 17:12:54,188 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 17:12:54,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 17:12:54,213 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-19 17:12:54,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:12:54 BoogieIcfgContainer [2023-12-19 17:12:54,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 17:12:54,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 17:12:54,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 17:12:54,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 17:12:54,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:12:53" (1/3) ... [2023-12-19 17:12:54,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c0c64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:12:54, skipping insertion in model container [2023-12-19 17:12:54,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:12:53" (2/3) ... [2023-12-19 17:12:54,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c0c64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:12:54, skipping insertion in model container [2023-12-19 17:12:54,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:12:54" (3/3) ... [2023-12-19 17:12:54,222 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-12-19 17:12:54,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 17:12:54,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 17:12:54,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 17:12:54,277 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;@2a9056c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 17:12:54,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 17:12:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-19 17:12:54,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:12:54,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:12:54,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:12:54,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:12:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445379, now seen corresponding path program 1 times [2023-12-19 17:12:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:12:54,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550466699] [2023-12-19 17:12:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:12:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 17:12:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:54,542 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-19 17:12:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:12:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550466699] [2023-12-19 17:12:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550466699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:12:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:12:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:12:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17683822] [2023-12-19 17:12:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:12:54,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 17:12:54,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:12:54,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 17:12:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:12:54,587 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:12:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:12:54,647 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2023-12-19 17:12:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 17:12:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-19 17:12:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:12:54,654 INFO L225 Difference]: With dead ends: 46 [2023-12-19 17:12:54,655 INFO L226 Difference]: Without dead ends: 20 [2023-12-19 17:12:54,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 17:12:54,661 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:12:54,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:12:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-19 17:12:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-19 17:12:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-19 17:12:54,692 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2023-12-19 17:12:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:12:54,692 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-19 17:12:54,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:12:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-19 17:12:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-19 17:12:54,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:12:54,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:12:54,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 17:12:54,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:12:54,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:12:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 391783627, now seen corresponding path program 1 times [2023-12-19 17:12:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:12:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803547960] [2023-12-19 17:12:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:12:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 17:12:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:54,888 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-19 17:12:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:12:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803547960] [2023-12-19 17:12:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803547960] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:12:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:12:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:12:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856678499] [2023-12-19 17:12:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:12:54,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:12:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:12:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:12:54,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:12:54,894 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:12:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:12:54,933 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-19 17:12:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:12:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-19 17:12:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:12:54,935 INFO L225 Difference]: With dead ends: 39 [2023-12-19 17:12:54,935 INFO L226 Difference]: Without dead ends: 23 [2023-12-19 17:12:54,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:12:54,937 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:12:54,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:12:54,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-19 17:12:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-19 17:12:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-19 17:12:54,947 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2023-12-19 17:12:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:12:54,947 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-19 17:12:54,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:12:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-19 17:12:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-19 17:12:54,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:12:54,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:12:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 17:12:54,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:12:54,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:12:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1783597384, now seen corresponding path program 1 times [2023-12-19 17:12:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:12:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813035356] [2023-12-19 17:12:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:12:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:12:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 17:12:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:12:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:12:55,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813035356] [2023-12-19 17:12:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813035356] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:12:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065926885] [2023-12-19 17:12:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:55,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:12:55,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:12:55,144 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-19 17:12:55,168 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-19 17:12:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 17:12:55,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:12:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:12:55,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:12:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:12:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065926885] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:12:55,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:12:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-19 17:12:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582625827] [2023-12-19 17:12:55,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:12:55,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 17:12:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:12:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 17:12:55,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:12:55,355 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 17:12:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:12:55,386 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-19 17:12:55,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 17:12:55,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-12-19 17:12:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:12:55,387 INFO L225 Difference]: With dead ends: 40 [2023-12-19 17:12:55,387 INFO L226 Difference]: Without dead ends: 24 [2023-12-19 17:12:55,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:12:55,388 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:12:55,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:12:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-19 17:12:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-19 17:12:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:12:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-19 17:12:55,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2023-12-19 17:12:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:12:55,391 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-19 17:12:55,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 17:12:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-19 17:12:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-19 17:12:55,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:12:55,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:12:55,405 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-19 17:12:55,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:12:55,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:12:55,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:12:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1298850533, now seen corresponding path program 2 times [2023-12-19 17:12:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:12:55,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423136452] [2023-12-19 17:12:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:55,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:12:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:12:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:12:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:12:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-19 17:12:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:12:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423136452] [2023-12-19 17:12:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423136452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:12:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654723049] [2023-12-19 17:12:55,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:12:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:12:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:12:55,995 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-19 17:12:55,997 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-19 17:12:56,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-19 17:12:56,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:12:56,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-19 17:12:56,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:12:56,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 17:12:56,356 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 16 treesize of output 8 [2023-12-19 17:12:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-19 17:12:56,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 17:12:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654723049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:12:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 17:12:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-12-19 17:12:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561211367] [2023-12-19 17:12:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:12:56,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 17:12:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:12:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 17:12:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2023-12-19 17:12:56,359 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:12:56,431 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-12-19 17:12:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 17:12:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-19 17:12:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:12:56,432 INFO L225 Difference]: With dead ends: 37 [2023-12-19 17:12:56,432 INFO L226 Difference]: Without dead ends: 34 [2023-12-19 17:12:56,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-12-19 17:12:56,433 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:12:56,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:12:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-19 17:12:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-12-19 17:12:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:12:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-19 17:12:56,436 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2023-12-19 17:12:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:12:56,436 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-19 17:12:56,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-19 17:12:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-19 17:12:56,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:12:56,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:12:56,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 17:12:56,642 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,SelfDestructingSolverStorable3 [2023-12-19 17:12:56,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:12:56,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:12:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1298852207, now seen corresponding path program 1 times [2023-12-19 17:12:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:12:56,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329878648] [2023-12-19 17:12:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:12:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:12:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:12:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:12:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-19 17:12:56,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:12:56,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329878648] [2023-12-19 17:12:56,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329878648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:12:56,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:12:56,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 17:12:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631234696] [2023-12-19 17:12:56,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:12:56,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 17:12:56,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:12:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 17:12:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-19 17:12:56,961 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:12:57,118 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-19 17:12:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 17:12:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-19 17:12:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:12:57,120 INFO L225 Difference]: With dead ends: 34 [2023-12-19 17:12:57,120 INFO L226 Difference]: Without dead ends: 32 [2023-12-19 17:12:57,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-19 17:12:57,120 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:12:57,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:12:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-19 17:12:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2023-12-19 17:12:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:12:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-19 17:12:57,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2023-12-19 17:12:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:12:57,124 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-19 17:12:57,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:12:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-19 17:12:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-19 17:12:57,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:12:57,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:12:57,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 17:12:57,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:12:57,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:12:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1638479424, now seen corresponding path program 1 times [2023-12-19 17:12:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:12:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524124437] [2023-12-19 17:12:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:12:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:12:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:12:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:12:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 17:12:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:12:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524124437] [2023-12-19 17:12:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524124437] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:12:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043151600] [2023-12-19 17:12:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:12:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:12:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:12:57,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:12:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 17:12:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:12:57,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-19 17:12:57,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:12:57,554 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 16 treesize of output 8 [2023-12-19 17:12:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:12:57,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:12:57,593 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 8 treesize of output 4 [2023-12-19 17:12:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 17:12:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043151600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:12:57,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:12:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-12-19 17:12:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286021414] [2023-12-19 17:12:57,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:12:57,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 17:12:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:12:57,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 17:12:57,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-19 17:12:57,616 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-19 17:13:01,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:05,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:09,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:13,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:17,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:17,857 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-12-19 17:13:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 17:13:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2023-12-19 17:13:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:17,858 INFO L225 Difference]: With dead ends: 35 [2023-12-19 17:13:17,858 INFO L226 Difference]: Without dead ends: 27 [2023-12-19 17:13:17,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-19 17:13:17,859 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:17,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-19 17:13:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-19 17:13:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-19 17:13:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:13:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-19 17:13:17,863 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2023-12-19 17:13:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:17,863 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-19 17:13:17,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-19 17:13:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-19 17:13:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-19 17:13:17,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:17,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:17,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 17:13:18,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:18,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:18,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:18,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1736900497, now seen corresponding path program 1 times [2023-12-19 17:13:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:18,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485638056] [2023-12-19 17:13:18,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:18,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:18,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:18,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 17:13:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485638056] [2023-12-19 17:13:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485638056] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338613705] [2023-12-19 17:13:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:18,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:18,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:18,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:13:18,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 17:13:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:18,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-19 17:13:18,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:18,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-19 17:13:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:18,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 17:13:18,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338613705] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:13:18,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:13:18,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 16 [2023-12-19 17:13:18,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539748248] [2023-12-19 17:13:18,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:18,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 17:13:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 17:13:18,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2023-12-19 17:13:18,637 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-19 17:13:22,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:26,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:30,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:34,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:38,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:13:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:38,885 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-12-19 17:13:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 17:13:38,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-12-19 17:13:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:38,886 INFO L225 Difference]: With dead ends: 34 [2023-12-19 17:13:38,886 INFO L226 Difference]: Without dead ends: 31 [2023-12-19 17:13:38,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2023-12-19 17:13:38,887 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:38,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-19 17:13:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-19 17:13:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-19 17:13:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:13:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-19 17:13:38,892 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2023-12-19 17:13:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:38,893 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-19 17:13:38,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-19 17:13:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-19 17:13:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-19 17:13:38,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:38,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:38,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 17:13:39,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:39,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1736898823, now seen corresponding path program 1 times [2023-12-19 17:13:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:39,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958877181] [2023-12-19 17:13:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:39,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-19 17:13:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958877181] [2023-12-19 17:13:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958877181] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39551738] [2023-12-19 17:13:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:39,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:39,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:39,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:13:39,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 17:13:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:39,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-19 17:13:39,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:40,017 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-19 17:13:40,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:13:40,067 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 23 treesize of output 11 [2023-12-19 17:13:40,150 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 11 treesize of output 3 [2023-12-19 17:13:40,153 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 9 treesize of output 3 [2023-12-19 17:13:40,219 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0))) is different from true [2023-12-19 17:13:40,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:40,240 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-19 17:13:40,253 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:13:40,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-19 17:13:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:40,377 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 31 treesize of output 15 [2023-12-19 17:13:40,445 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 19 treesize of output 11 [2023-12-19 17:13:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-12-19 17:13:40,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39551738] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:40,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:40,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-19 17:13:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670287522] [2023-12-19 17:13:40,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:40,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 17:13:40,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 17:13:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2023-12-19 17:13:40,795 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-19 17:13:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:41,259 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-19 17:13:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 17:13:41,259 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-19 17:13:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:41,259 INFO L225 Difference]: With dead ends: 41 [2023-12-19 17:13:41,260 INFO L226 Difference]: Without dead ends: 39 [2023-12-19 17:13:41,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=1404, Unknown=1, NotChecked=76, Total=1640 [2023-12-19 17:13:41,261 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:41,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 124 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2023-12-19 17:13:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-19 17:13:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2023-12-19 17:13:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:13:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-12-19 17:13:41,266 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2023-12-19 17:13:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:41,266 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-12-19 17:13:41,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-19 17:13:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-12-19 17:13:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-19 17:13:41,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:41,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:41,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 17:13:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:41,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:41,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542026, now seen corresponding path program 1 times [2023-12-19 17:13:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:41,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099517607] [2023-12-19 17:13:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:13:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099517607] [2023-12-19 17:13:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099517607] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551834300] [2023-12-19 17:13:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:41,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:41,955 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:13:41,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 17:13:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:42,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-19 17:13:42,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:42,103 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-19 17:13:42,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-19 17:13:42,202 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 18 treesize of output 4 [2023-12-19 17:13:42,204 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 9 treesize of output 3 [2023-12-19 17:13:42,231 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-19 17:13:42,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:42,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-19 17:13:42,249 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:13:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-19 17:13:42,331 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2023-12-19 17:13:42,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2023-12-19 17:13:42,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-12-19 17:13:42,342 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 22 treesize of output 14 [2023-12-19 17:13:42,360 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 20 treesize of output 8 [2023-12-19 17:13:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-19 17:13:42,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:42,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_40| Int) (v_ArrVal_1016 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40| v_ArrVal_1016) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_40|) 0)))) is different from false [2023-12-19 17:13:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551834300] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:42,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 30 [2023-12-19 17:13:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31758164] [2023-12-19 17:13:42,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-19 17:13:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-19 17:13:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=850, Unknown=2, NotChecked=118, Total=1056 [2023-12-19 17:13:42,541 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-19 17:13:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:43,017 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-12-19 17:13:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 17:13:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2023-12-19 17:13:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:43,020 INFO L225 Difference]: With dead ends: 47 [2023-12-19 17:13:43,020 INFO L226 Difference]: Without dead ends: 38 [2023-12-19 17:13:43,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=1573, Unknown=2, NotChecked=162, Total=1892 [2023-12-19 17:13:43,021 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:43,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 301 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2023-12-19 17:13:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-19 17:13:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-12-19 17:13:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:13:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-19 17:13:43,025 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 30 [2023-12-19 17:13:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:43,026 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-19 17:13:43,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-19 17:13:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-19 17:13:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-19 17:13:43,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:43,026 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:43,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 17:13:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:43,232 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:43,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1135989524, now seen corresponding path program 1 times [2023-12-19 17:13:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68556598] [2023-12-19 17:13:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:44,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:44,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68556598] [2023-12-19 17:13:44,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68556598] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:44,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097943778] [2023-12-19 17:13:44,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:44,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:44,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:44,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:13:44,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 17:13:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:44,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-19 17:13:44,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:44,351 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-19 17:13:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:13:44,563 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:13:44,563 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-19 17:13:44,616 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 23 treesize of output 11 [2023-12-19 17:13:44,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 17:13:44,732 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 30 treesize of output 14 [2023-12-19 17:13:44,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2023-12-19 17:13:44,740 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 11 treesize of output 3 [2023-12-19 17:13:44,818 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2023-12-19 17:13:44,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:44,835 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 38 treesize of output 27 [2023-12-19 17:13:44,850 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:13:44,851 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 28 treesize of output 30 [2023-12-19 17:13:44,855 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 20 treesize of output 15 [2023-12-19 17:13:45,032 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 28 treesize of output 12 [2023-12-19 17:13:45,106 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-19 17:13:45,155 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 19 treesize of output 11 [2023-12-19 17:13:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-19 17:13:45,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:45,299 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) v_ArrVal_1173) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-19 17:13:45,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097943778] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:45,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:45,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2023-12-19 17:13:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425671311] [2023-12-19 17:13:45,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:45,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-19 17:13:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-19 17:13:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1725, Unknown=36, NotChecked=170, Total=2070 [2023-12-19 17:13:45,463 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 42 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:13:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:50,591 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-12-19 17:13:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 17:13:50,591 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2023-12-19 17:13:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:50,592 INFO L225 Difference]: With dead ends: 47 [2023-12-19 17:13:50,592 INFO L226 Difference]: Without dead ends: 45 [2023-12-19 17:13:50,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=301, Invalid=3208, Unknown=39, NotChecked=234, Total=3782 [2023-12-19 17:13:50,593 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:50,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 230 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 557 Invalid, 0 Unknown, 47 Unchecked, 0.5s Time] [2023-12-19 17:13:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-19 17:13:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2023-12-19 17:13:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:13:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-12-19 17:13:50,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 30 [2023-12-19 17:13:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:50,599 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-12-19 17:13:50,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:13:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-12-19 17:13:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 17:13:50,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:50,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:50,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 17:13:50,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:50,807 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:50,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash 764273839, now seen corresponding path program 1 times [2023-12-19 17:13:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965551327] [2023-12-19 17:13:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:52,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965551327] [2023-12-19 17:13:52,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965551327] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:52,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417660718] [2023-12-19 17:13:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:52,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:13:52,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 17:13:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:52,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 133 conjunts are in the unsatisfiable core [2023-12-19 17:13:52,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:52,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:13:52,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:13:53,129 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 23 treesize of output 11 [2023-12-19 17:13:53,362 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:13:53,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-19 17:13:53,372 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 16 treesize of output 11 [2023-12-19 17:13:53,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-19 17:13:53,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-19 17:13:53,458 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 22 treesize of output 17 [2023-12-19 17:13:53,647 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 81 treesize of output 25 [2023-12-19 17:13:53,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2023-12-19 17:13:53,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-19 17:13:53,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-19 17:13:53,760 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-19 17:13:53,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:53,777 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 89 treesize of output 66 [2023-12-19 17:13:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:53,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-19 17:13:53,805 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:13:53,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-12-19 17:13:53,811 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 26 treesize of output 21 [2023-12-19 17:13:54,300 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2023-12-19 17:13:54,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 172 [2023-12-19 17:13:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:54,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 25 [2023-12-19 17:13:54,318 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 79 treesize of output 21 [2023-12-19 17:13:54,425 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 86 treesize of output 62 [2023-12-19 17:13:54,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2023-12-19 17:13:54,501 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 43 treesize of output 19 [2023-12-19 17:13:54,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-19 17:13:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-19 17:13:54,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417660718] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:55,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-12-19 17:13:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980917000] [2023-12-19 17:13:55,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:55,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-19 17:13:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-19 17:13:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3308, Unknown=29, NotChecked=116, Total=3660 [2023-12-19 17:13:55,868 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:13:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:58,110 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-12-19 17:13:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-19 17:13:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-19 17:13:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:58,111 INFO L225 Difference]: With dead ends: 49 [2023-12-19 17:13:58,111 INFO L226 Difference]: Without dead ends: 47 [2023-12-19 17:13:58,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=459, Invalid=5836, Unknown=29, NotChecked=156, Total=6480 [2023-12-19 17:13:58,112 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:58,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 343 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1000 Invalid, 0 Unknown, 48 Unchecked, 0.7s Time] [2023-12-19 17:13:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-19 17:13:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2023-12-19 17:13:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:13:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-12-19 17:13:58,118 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2023-12-19 17:13:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:58,118 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-12-19 17:13:58,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:13:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-12-19 17:13:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 17:13:58,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:58,119 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:58,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 17:13:58,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 17:13:58,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:58,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 317719663, now seen corresponding path program 2 times [2023-12-19 17:13:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071363235] [2023-12-19 17:13:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071363235] [2023-12-19 17:13:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071363235] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657461878] [2023-12-19 17:13:59,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:13:59,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:59,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:59,543 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:13:59,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 17:13:59,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:13:59,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:13:59,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 137 conjunts are in the unsatisfiable core [2023-12-19 17:13:59,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:59,772 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-19 17:13:59,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:13:59,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:13:59,987 WARN L854 $PredicateComparison]: unable to prove that (and (= 1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0))) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-12-19 17:13:59,991 WARN L876 $PredicateComparison]: unable to prove that (and (= 1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0))) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-12-19 17:14:00,014 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 23 treesize of output 11 [2023-12-19 17:14:00,039 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-19 17:14:00,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-12-19 17:14:00,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 17:14:00,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_91| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_91|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_91| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_91| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:00,064 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_91| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_91|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_91| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_91| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:00,097 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:00,099 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:00,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-19 17:14:00,137 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-19 17:14:00,156 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 29 treesize of output 13 [2023-12-19 17:14:00,160 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 11 treesize of output 3 [2023-12-19 17:14:00,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,167 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 19 treesize of output 7 [2023-12-19 17:14:00,182 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from false [2023-12-19 17:14:00,184 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from true [2023-12-19 17:14:00,207 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from false [2023-12-19 17:14:00,210 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from true [2023-12-19 17:14:00,233 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from false [2023-12-19 17:14:00,235 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from true [2023-12-19 17:14:00,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,272 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 37 treesize of output 26 [2023-12-19 17:14:00,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-12-19 17:14:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,289 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-19 17:14:00,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from false [2023-12-19 17:14:00,321 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from true [2023-12-19 17:14:00,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from false [2023-12-19 17:14:00,441 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from true [2023-12-19 17:14:00,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 40 treesize of output 16 [2023-12-19 17:14:00,553 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))) is different from false [2023-12-19 17:14:00,556 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))) is different from true [2023-12-19 17:14:00,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))) is different from false [2023-12-19 17:14:00,649 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))) is different from true [2023-12-19 17:14:00,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,767 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 19 treesize of output 7 [2023-12-19 17:14:00,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:00,779 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 31 treesize of output 15 [2023-12-19 17:14:00,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))) is different from false [2023-12-19 17:14:00,794 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))) is different from true [2023-12-19 17:14:00,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:14:00,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2023-12-19 17:14:00,822 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:14:00,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:14:00,838 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2023-12-19 17:14:00,840 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2023-12-19 17:14:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-12-19 17:14:00,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:14:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657461878] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:01,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:14:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2023-12-19 17:14:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81502013] [2023-12-19 17:14:01,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:01,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-19 17:14:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-19 17:14:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1008, Unknown=26, NotChecked=988, Total=2162 [2023-12-19 17:14:01,525 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 42 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:14:01,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0))) (and (= 1 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) .cse2) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) .cse2 (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:01,764 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0))) (and (= 1 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)))) .cse2) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) .cse2 (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:01,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0))) (and (= .cse0 1) (or (and .cse1 .cse2) (exists ((|v_#memory_$Pointer$#2.offset_91| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_91|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3) 4) 0) (= |v_#memory_$Pointer$#2.offset_91| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |v_#memory_$Pointer$#2.offset_91| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) .cse1 (= (select |c_#valid| .cse3) 1) .cse2 (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2023-12-19 17:14:01,771 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0))) (and (= .cse0 1) (or (and .cse1 .cse2) (exists ((|v_#memory_$Pointer$#2.offset_91| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_91|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3) 4) 0) (= |v_#memory_$Pointer$#2.offset_91| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |v_#memory_$Pointer$#2.offset_91| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_91| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) .cse1 (= (select |c_#valid| .cse3) 1) .cse2 (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2023-12-19 17:14:01,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:01,776 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:01,780 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:14:01,783 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:14:01,786 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from false [2023-12-19 17:14:01,788 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from true [2023-12-19 17:14:01,791 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from false [2023-12-19 17:14:01,792 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))) is different from true [2023-12-19 17:14:01,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse3 (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) .cse3) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (or .cse3 (= .cse2 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from false [2023-12-19 17:14:01,810 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse3 (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) .cse3) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (or .cse3 (= .cse2 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from true [2023-12-19 17:14:01,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) 4) 0) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from false [2023-12-19 17:14:01,826 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) 4) 0) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from true [2023-12-19 17:14:01,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse4 0) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from false [2023-12-19 17:14:01,838 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse4 0) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from true [2023-12-19 17:14:01,846 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse4 0) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from false [2023-12-19 17:14:01,849 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse4 0) 0) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)))))))) is different from true [2023-12-19 17:14:01,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from false [2023-12-19 17:14:01,861 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from true [2023-12-19 17:14:01,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from false [2023-12-19 17:14:01,872 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse3 0) 0) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from true [2023-12-19 17:14:01,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse4 0)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) .cse2))) (and .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)) (not (= .cse2 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0))))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select (select |c_#memory_int#2| .cse5) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse3 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from false [2023-12-19 17:14:01,884 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse4 0)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) .cse2))) (and .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)) (not (= .cse2 4)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0))))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select (select |c_#memory_int#2| .cse5) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse3 0) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from true [2023-12-19 17:14:01,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from false [2023-12-19 17:14:01,919 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimCell_64 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_64) 1) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))))))) is different from true [2023-12-19 17:14:01,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1))) is different from false [2023-12-19 17:14:01,935 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|node_create_~temp~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_35| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_sll_append_~last~0#1.base_35|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1))) is different from true [2023-12-19 17:14:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:01,958 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-12-19 17:14:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-19 17:14:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-19 17:14:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:01,959 INFO L225 Difference]: With dead ends: 48 [2023-12-19 17:14:01,959 INFO L226 Difference]: Without dead ends: 46 [2023-12-19 17:14:01,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=182, Invalid=1134, Unknown=56, NotChecked=2660, Total=4032 [2023-12-19 17:14:01,960 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:01,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 1102 Unchecked, 0.2s Time] [2023-12-19 17:14:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-19 17:14:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-19 17:14:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:14:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-12-19 17:14:01,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 32 [2023-12-19 17:14:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:01,967 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-12-19 17:14:01,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:14:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-12-19 17:14:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:14:01,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:01,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:14:01,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 17:14:02,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:02,168 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:02,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 27784448, now seen corresponding path program 1 times [2023-12-19 17:14:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:02,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899836844] [2023-12-19 17:14:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:14:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:14:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899836844] [2023-12-19 17:14:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899836844] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678671777] [2023-12-19 17:14:03,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:03,604 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:14:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 17:14:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:03,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 126 conjunts are in the unsatisfiable core [2023-12-19 17:14:03,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:03,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:14:04,082 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:14:04,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-19 17:14:04,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:14:04,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 17:14:04,269 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 42 treesize of output 18 [2023-12-19 17:14:04,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:14:04,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-19 17:14:04,454 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:14:04,455 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-19 17:14:04,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:04,468 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 50 treesize of output 33 [2023-12-19 17:14:04,482 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:14:04,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-19 17:14:05,085 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2023-12-19 17:14:05,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 76 [2023-12-19 17:14:05,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:05,093 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-19 17:14:05,178 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 91 treesize of output 59 [2023-12-19 17:14:05,242 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 7 treesize of output 3 [2023-12-19 17:14:05,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:14:05,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-12-19 17:14:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:14:05,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:14:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678671777] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:06,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:14:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2023-12-19 17:14:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271036109] [2023-12-19 17:14:06,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:06,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-19 17:14:06,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-19 17:14:06,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3453, Unknown=0, NotChecked=0, Total=3660 [2023-12-19 17:14:06,163 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 42 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:14:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:08,187 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-12-19 17:14:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-19 17:14:08,188 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 42 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-19 17:14:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:08,188 INFO L225 Difference]: With dead ends: 60 [2023-12-19 17:14:08,188 INFO L226 Difference]: Without dead ends: 57 [2023-12-19 17:14:08,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=486, Invalid=6320, Unknown=0, NotChecked=0, Total=6806 [2023-12-19 17:14:08,190 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 99 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:08,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 336 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 17:14:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-19 17:14:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2023-12-19 17:14:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:14:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-12-19 17:14:08,197 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 34 [2023-12-19 17:14:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:08,197 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-12-19 17:14:08,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 42 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:14:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-12-19 17:14:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:14:08,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:08,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:14:08,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-19 17:14:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 17:14:08,404 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:08,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash 27786122, now seen corresponding path program 2 times [2023-12-19 17:14:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133285072] [2023-12-19 17:14:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:09,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:14:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:14:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:10,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133285072] [2023-12-19 17:14:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133285072] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156107729] [2023-12-19 17:14:10,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:14:10,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:10,211 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:14:10,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 17:14:10,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:14:10,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:14:10,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 148 conjunts are in the unsatisfiable core [2023-12-19 17:14:10,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:10,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:14:10,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:14:10,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:14:10,751 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| |c_#memory_$Pointer$#2.offset|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= 0 (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_12| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_12| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-12-19 17:14:10,755 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| |c_#memory_$Pointer$#2.offset|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= 0 (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_12| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_12| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret5#1.base|))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-12-19 17:14:10,794 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-19 17:14:10,795 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 1 case distinctions, treesize of input 23 treesize of output 22 [2023-12-19 17:14:10,814 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-19 17:14:10,814 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 1 case distinctions, treesize of input 27 treesize of output 23 [2023-12-19 17:14:10,838 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_113| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_113| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_113| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| |v_#memory_$Pointer$#2.offset_113|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| .cse0) 4) 0) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| .cse1 (select |v_#memory_$Pointer$#2.offset_113| .cse1)) |v_#memory_$Pointer$#2.offset_113|))))))) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |c_#valid| .cse2)))))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:10,842 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_113| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_113| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_113| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| |v_#memory_$Pointer$#2.offset_113|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| .cse0) 4) 0) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_10| .cse1 (select |v_#memory_$Pointer$#2.offset_113| .cse1)) |v_#memory_$Pointer$#2.offset_113|))))))) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |c_#valid| .cse2)))))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:10,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:10,879 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:10,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 0))) (not (= .cse0 0)) (= |c_ULTIMATE.start_sll_append_~data#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:14:10,913 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 0))) (not (= .cse0 0)) (= |c_ULTIMATE.start_sll_append_~data#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:14:10,925 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:14:10,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2023-12-19 17:14:10,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:10,931 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 19 treesize of output 7 [2023-12-19 17:14:10,953 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:14:10,955 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:14:10,999 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:14:11,001 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:14:11,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:14:11,039 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:14:11,041 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:14:11,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:11,068 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:14:11,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 57 [2023-12-19 17:14:11,098 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-19 17:14:11,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2023-12-19 17:14:11,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= 1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:14:11,175 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= 1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:14:11,247 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:14:11,250 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:14:11,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:14:11,554 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:14:11,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:14:11,656 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 0))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4)))) (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:14:11,725 INFO L349 Elim1Store]: treesize reduction 104, result has 20.6 percent of original size [2023-12-19 17:14:11,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 70 [2023-12-19 17:14:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:11,759 INFO L349 Elim1Store]: treesize reduction 84, result has 24.3 percent of original size [2023-12-19 17:14:11,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 74 [2023-12-19 17:14:11,776 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2023-12-19 17:14:11,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2023-12-19 17:14:12,131 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (not (= .cse0 0)) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_old(#valid)_AFTER_CALL_32| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse3) 0))) .cse6 .cse7 (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (and (= .cse5 0) .cse6 .cse7 (or (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse8 (select |v_old(#valid)_AFTER_CALL_32| .cse8)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_32| .cse9)) (= .cse9 |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10) 0))))))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_old(#valid)_AFTER_CALL_32| .cse11)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse13))) (and (= (select (select |c_#memory_int#2| .cse12) 0) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_32| .cse12)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse13) 0))))))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse3) 0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:14:12,135 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (not (= .cse0 0)) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|))) (and (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_4) 1) (not (= v_arrayElimIndex_4 0)) (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_24|) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse2 (select |v_#valid_BEFORE_CALL_24| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_old(#valid)_AFTER_CALL_32| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse3) 0))) .cse6 .cse7 (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (and (= .cse5 0) .cse6 .cse7 (or (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse8 (select |v_old(#valid)_AFTER_CALL_32| .cse8)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_32| .cse9)) (= .cse9 |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10) 0))))))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_old(#valid)_AFTER_CALL_32| .cse11)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse13))) (and (= (select (select |c_#memory_int#2| .cse12) 0) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_32| .cse12)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse13) 0))))))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse3) 0))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:14:12,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:14:12,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 338 treesize of output 270 [2023-12-19 17:14:12,271 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:14:12,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:14:12,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0))) .cse3 .cse4 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (and (= .cse2 0) .cse3 (or (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse5 (+ v_prenex_15 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| v_prenex_14) .cse5))) (and (= (select v_prenex_13 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse5) 0) (= (select v_prenex_12 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= .cse6 v_prenex_14) (= (select v_prenex_13 .cse6) 0) (= (select v_prenex_12 .cse0) 1) (= v_prenex_13 (let ((.cse7 (@diff v_prenex_12 v_prenex_13))) (store v_prenex_12 .cse7 (select v_prenex_13 .cse7)))))))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (v_prenex_17 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int) (v_prenex_16 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10))) (and (= (select (select |c_#memory_int#2| .cse8) 0) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_17 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse9 (@diff v_prenex_16 v_prenex_17))) (store v_prenex_16 .cse9 (select v_prenex_17 .cse9))) v_prenex_17) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10) 0) (= (select v_prenex_17 .cse8) 0) (= (select v_prenex_16 .cse0) 1)))))) .cse4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)))) is different from false [2023-12-19 17:14:12,342 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0))) .cse3 .cse4 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (and (= .cse2 0) .cse3 (or (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse5 (+ v_prenex_15 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| v_prenex_14) .cse5))) (and (= (select v_prenex_13 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse5) 0) (= (select v_prenex_12 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= .cse6 v_prenex_14) (= (select v_prenex_13 .cse6) 0) (= (select v_prenex_12 .cse0) 1) (= v_prenex_13 (let ((.cse7 (@diff v_prenex_12 v_prenex_13))) (store v_prenex_12 .cse7 (select v_prenex_13 .cse7)))))))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (v_prenex_17 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int) (v_prenex_16 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10))) (and (= (select (select |c_#memory_int#2| .cse8) 0) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_17 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse9 (@diff v_prenex_16 v_prenex_17))) (store v_prenex_16 .cse9 (select v_prenex_17 .cse9))) v_prenex_17) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse10) 0) (= (select v_prenex_17 .cse8) 0) (= (select v_prenex_16 .cse0) 1)))))) .cse4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)))) is different from true [2023-12-19 17:14:12,525 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse8 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (or (exists ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (v_prenex_17 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int) (v_prenex_16 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse3))) (and (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= (select v_prenex_17 |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff v_prenex_16 v_prenex_17))) (store v_prenex_16 .cse2 (select v_prenex_17 .cse2))) v_prenex_17) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse3) 0) (= (select v_prenex_17 .cse1) 0) (= (select v_prenex_16 |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_16 .cse0) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_main_~temp~2#1.base|)))) (exists ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse4 (+ v_prenex_15 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| v_prenex_14) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse4) 0) (= (select v_prenex_12 .cse5) 1) (= (select v_prenex_13 |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= .cse6 v_prenex_14) (= (select v_prenex_12 |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_13 .cse6) 0) (= v_prenex_13 (let ((.cse7 (@diff v_prenex_12 v_prenex_13))) (store v_prenex_12 .cse7 (select v_prenex_13 .cse7)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_main_~temp~2#1.base|))))) .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) 4))) (and (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_32| .cse9) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_old(#valid)_AFTER_CALL_32| .cse11)))) (not (= .cse10 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= .cse10 |c_ULTIMATE.start_main_~temp~2#1.base|))))) .cse8))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-12-19 17:14:12,529 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse8 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (or (exists ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (v_prenex_17 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int) (v_prenex_16 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse3))) (and (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= (select v_prenex_17 |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff v_prenex_16 v_prenex_17))) (store v_prenex_16 .cse2 (select v_prenex_17 .cse2))) v_prenex_17) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse3) 0) (= (select v_prenex_17 .cse1) 0) (= (select v_prenex_16 |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_16 .cse0) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_main_~temp~2#1.base|)))) (exists ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse4 (+ v_prenex_15 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| v_prenex_14) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse4) 0) (= (select v_prenex_12 .cse5) 1) (= (select v_prenex_13 |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= .cse6 v_prenex_14) (= (select v_prenex_12 |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_13 .cse6) 0) (= v_prenex_13 (let ((.cse7 (@diff v_prenex_12 v_prenex_13))) (store v_prenex_12 .cse7 (select v_prenex_13 .cse7)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_main_~temp~2#1.base|))))) .cse8) (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) 4))) (and (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_32| .cse9) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_old(#valid)_AFTER_CALL_32| .cse11)))) (not (= .cse10 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= .cse10 |c_ULTIMATE.start_main_~temp~2#1.base|))))) .cse8))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-12-19 17:14:12,697 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((v_subst_9 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_subst_9) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| v_subst_9) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (v_prenex_17 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int) (v_prenex_16 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse4))) (and (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= (let ((.cse2 (@diff v_prenex_16 v_prenex_17))) (store v_prenex_16 .cse2 (select v_prenex_17 .cse2))) v_prenex_17) (= 1 (select v_prenex_16 .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse4) 0) (= (select v_prenex_17 .cse1) 0) (= (select v_prenex_17 v_subst_9) 1) (= (select v_prenex_16 v_subst_9) 0))))) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)))) (exists ((v_subst_8 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_subst_8) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| v_subst_8) 4) 0) (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse5 (+ v_prenex_15 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| v_prenex_14) .cse5))) (and (= (select v_prenex_12 v_subst_8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse5) 0) (= (select v_prenex_13 v_subst_8) 1) (= .cse6 v_prenex_14) (= (select v_prenex_13 .cse6) 0) (= v_prenex_13 (let ((.cse7 (@diff v_prenex_12 v_prenex_13))) (store v_prenex_12 .cse7 (select v_prenex_13 .cse7)))) (= (select v_prenex_12 .cse8) 1))))) (= .cse8 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (not (= .cse8 0))))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (v_subst_7 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| v_subst_7) 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse9) (not (= .cse9 0)) (= (select |v_old(#valid)_AFTER_CALL_32| .cse10) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_old(#valid)_AFTER_CALL_32| .cse11)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_subst_7) 1) (= (select |v_old(#valid)_AFTER_CALL_31| v_subst_7) 0) (= (select (select |c_#memory_int#2| .cse10) 0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_subst_7) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse9) 1))))))))) is different from false [2023-12-19 17:14:12,701 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((v_subst_9 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_subst_9) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| v_subst_9) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_49| Int) (v_prenex_17 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_44| Int) (v_prenex_16 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_44| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse4))) (and (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= (let ((.cse2 (@diff v_prenex_16 v_prenex_17))) (store v_prenex_16 .cse2 (select v_prenex_17 .cse2))) v_prenex_17) (= 1 (select v_prenex_16 .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_49|) .cse4) 0) (= (select v_prenex_17 .cse1) 0) (= (select v_prenex_17 v_subst_9) 1) (= (select v_prenex_16 v_subst_9) 0))))) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)))) (exists ((v_subst_8 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_subst_8) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| v_subst_8) 4) 0) (exists ((v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (let ((.cse5 (+ v_prenex_15 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| v_prenex_14) .cse5))) (and (= (select v_prenex_12 v_subst_8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse5) 0) (= (select v_prenex_13 v_subst_8) 1) (= .cse6 v_prenex_14) (= (select v_prenex_13 .cse6) 0) (= v_prenex_13 (let ((.cse7 (@diff v_prenex_12 v_prenex_13))) (store v_prenex_12 .cse7 (select v_prenex_13 .cse7)))) (= (select v_prenex_12 .cse8) 1))))) (= .cse8 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (not (= .cse8 0))))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (v_subst_7 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| v_subst_7) 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse9) (not (= .cse9 0)) (= (select |v_old(#valid)_AFTER_CALL_32| .cse10) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_old(#valid)_AFTER_CALL_32| .cse11)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_subst_7) 1) (= (select |v_old(#valid)_AFTER_CALL_31| v_subst_7) 0) (= (select (select |c_#memory_int#2| .cse10) 0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_subst_7) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse9) 1))))))))) is different from true [2023-12-19 17:14:13,199 INFO L349 Elim1Store]: treesize reduction 48, result has 86.2 percent of original size [2023-12-19 17:14:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 324 treesize of output 525 [2023-12-19 17:14:13,721 INFO L349 Elim1Store]: treesize reduction 48, result has 86.2 percent of original size [2023-12-19 17:14:13,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 220 treesize of output 480 [2023-12-19 17:16:34,719 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 1386 DAG size of output: 1585 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 17:18:46,315 WARN L293 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 1383 DAG size of output: 1570 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 17:21:36,218 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-19 17:21:36,221 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-19 17:21:36,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-19 17:21:36,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-19 17:21:36,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-19 17:21:36,429 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-12-19 17:21:36,432 INFO L158 Benchmark]: Toolchain (without parser) took 523057.91ms. Allocated memory was 217.1MB in the beginning and 1.1GB in the end (delta: 880.8MB). Free memory was 152.0MB in the beginning and 916.3MB in the end (delta: -764.3MB). Peak memory consumption was 648.1MB. Max. memory is 8.0GB. [2023-12-19 17:21:36,433 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 217.1MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 17:21:36,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.79ms. Allocated memory is still 217.1MB. Free memory was 151.8MB in the beginning and 133.7MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 17:21:36,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.28ms. Allocated memory was 217.1MB in the beginning and 305.1MB in the end (delta: 88.1MB). Free memory was 133.7MB in the beginning and 270.9MB in the end (delta: -137.2MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2023-12-19 17:21:36,433 INFO L158 Benchmark]: Boogie Preprocessor took 49.41ms. Allocated memory is still 305.1MB. Free memory was 270.9MB in the beginning and 267.7MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 17:21:36,433 INFO L158 Benchmark]: RCFGBuilder took 399.06ms. Allocated memory is still 305.1MB. Free memory was 267.7MB in the beginning and 249.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 17:21:36,433 INFO L158 Benchmark]: TraceAbstraction took 522216.44ms. Allocated memory was 305.1MB in the beginning and 1.1GB in the end (delta: 792.7MB). Free memory was 248.9MB in the beginning and 916.3MB in the end (delta: -667.5MB). Peak memory consumption was 655.7MB. Max. memory is 8.0GB. [2023-12-19 17:21:36,434 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.90ms. Allocated memory is still 217.1MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 330.79ms. Allocated memory is still 217.1MB. Free memory was 151.8MB in the beginning and 133.7MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.28ms. Allocated memory was 217.1MB in the beginning and 305.1MB in the end (delta: 88.1MB). Free memory was 133.7MB in the beginning and 270.9MB in the end (delta: -137.2MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.41ms. Allocated memory is still 305.1MB. Free memory was 270.9MB in the beginning and 267.7MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 399.06ms. Allocated memory is still 305.1MB. Free memory was 267.7MB in the beginning and 249.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 522216.44ms. Allocated memory was 305.1MB in the beginning and 1.1GB in the end (delta: 792.7MB). Free memory was 248.9MB in the beginning and 916.3MB in the end (delta: -667.5MB). Peak memory consumption was 655.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...