/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_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 17:13:16,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 17:13:16,777 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:13:16,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 17:13:16,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 17:13:16,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 17:13:16,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 17:13:16,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 17:13:16,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 17:13:16,815 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 17:13:16,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 17:13:16,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 17:13:16,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 17:13:16,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 17:13:16,822 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 17:13:16,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 17:13:16,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 17:13:16,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 17:13:16,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 17:13:16,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 17:13:16,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 17:13:16,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 17:13:16,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 17:13:16,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 17:13:16,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 17:13:16,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 17:13:16,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 17:13:16,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 17:13:16,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 17:13:16,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 17:13:16,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 17:13:16,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 17:13:16,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:13:16,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 17:13:16,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 17:13:16,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 17:13:16,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 17:13:16,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 17:13:16,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 17:13:16,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 17:13:16,830 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 17:13:16,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 17:13:16,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 17:13:16,831 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:13:17,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 17:13:17,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 17:13:17,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 17:13:17,072 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 17:13:17,073 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 17:13:17,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_unequal.i [2023-12-19 17:13:18,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 17:13:18,568 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 17:13:18,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_unequal.i [2023-12-19 17:13:18,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ac75e7c/8eeaaeedfbe4433f90bc89deb90a0bc4/FLAG98a9587c0 [2023-12-19 17:13:18,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ac75e7c/8eeaaeedfbe4433f90bc89deb90a0bc4 [2023-12-19 17:13:18,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 17:13:18,595 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 17:13:18,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 17:13:18,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 17:13:18,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 17:13:18,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:18,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9640f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18, skipping insertion in model container [2023-12-19 17:13:18,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:18,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 17:13:18,913 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_unequal.i[24323,24336] [2023-12-19 17:13:18,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:13:18,933 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 17:13:18,972 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_unequal.i[24323,24336] [2023-12-19 17:13:18,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:13:18,995 INFO L206 MainTranslator]: Completed translation [2023-12-19 17:13:18,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18 WrapperNode [2023-12-19 17:13:18,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 17:13:18,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 17:13:18,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 17:13:18,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 17:13:19,003 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:13:18" (1/1) ... [2023-12-19 17:13:19,016 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:13:18" (1/1) ... [2023-12-19 17:13:19,039 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-12-19 17:13:19,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 17:13:19,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 17:13:19,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 17:13:19,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 17:13:19,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,076 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2023-12-19 17:13:19,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 17:13:19,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 17:13:19,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 17:13:19,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 17:13:19,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (1/1) ... [2023-12-19 17:13:19,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:13:19,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:19,146 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:13:19,168 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:13:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 17:13:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 17:13:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 17:13:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 17:13:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 17:13:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 17:13:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-19 17:13:19,180 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-19 17:13:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-19 17:13:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-19 17:13:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-19 17:13:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-19 17:13:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 17:13:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 17:13:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 17:13:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 17:13:19,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 17:13:19,353 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 17:13:19,357 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 17:13:19,574 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 17:13:19,620 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 17:13:19,620 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-19 17:13:19,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:13:19 BoogieIcfgContainer [2023-12-19 17:13:19,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 17:13:19,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 17:13:19,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 17:13:19,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 17:13:19,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:13:18" (1/3) ... [2023-12-19 17:13:19,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:13:19, skipping insertion in model container [2023-12-19 17:13:19,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:13:18" (2/3) ... [2023-12-19 17:13:19,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:13:19, skipping insertion in model container [2023-12-19 17:13:19,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:13:19" (3/3) ... [2023-12-19 17:13:19,633 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-12-19 17:13:19,650 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 17:13:19,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 17:13:19,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 17:13:19,698 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;@19662c30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 17:13:19,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 17:13:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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:13:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-19 17:13:19,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:19,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:19,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:19,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash -427772013, now seen corresponding path program 1 times [2023-12-19 17:13:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623486518] [2023-12-19 17:13:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 17:13:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:19,940 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:13:19,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623486518] [2023-12-19 17:13:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623486518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:13:19,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:13:19,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:13:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029776701] [2023-12-19 17:13:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:13:19,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 17:13:19,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 17:13:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:13:19,975 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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:13:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:20,043 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2023-12-19 17:13:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 17:13:20,049 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:13:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:20,055 INFO L225 Difference]: With dead ends: 54 [2023-12-19 17:13:20,055 INFO L226 Difference]: Without dead ends: 24 [2023-12-19 17:13:20,059 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:13:20,065 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:20,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:13:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-19 17:13:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-19 17:13:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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:13:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-19 17:13:20,105 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2023-12-19 17:13:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:20,105 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-19 17:13:20,105 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:13:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-19 17:13:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-19 17:13:20,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:20,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:13:20,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 17:13:20,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:20,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1460433765, now seen corresponding path program 1 times [2023-12-19 17:13:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872145410] [2023-12-19 17:13:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 17:13:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:20,363 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:13:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872145410] [2023-12-19 17:13:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872145410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:13:20,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:13:20,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:13:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833816435] [2023-12-19 17:13:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:13:20,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:13:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:13:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:13:20,367 INFO L87 Difference]: Start difference. First operand 24 states and 31 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:13:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:20,415 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-12-19 17:13:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:13:20,415 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:13:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:20,416 INFO L225 Difference]: With dead ends: 47 [2023-12-19 17:13:20,416 INFO L226 Difference]: Without dead ends: 27 [2023-12-19 17:13:20,417 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:13:20,418 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:20,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:13:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-19 17:13:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-19 17:13:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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:13:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-19 17:13:20,431 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2023-12-19 17:13:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:20,432 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-19 17:13:20,432 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:13:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-19 17:13:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-19 17:13:20,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:20,433 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:13:20,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 17:13:20,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:20,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash 778109461, now seen corresponding path program 1 times [2023-12-19 17:13:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:20,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608361635] [2023-12-19 17:13:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 17:13:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:20,615 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:13:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608361635] [2023-12-19 17:13:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608361635] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845450281] [2023-12-19 17:13:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:20,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:20,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:20,623 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:13:20,639 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:13:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:20,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 17:13:20,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:20,835 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:13:20,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:20,878 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:13:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845450281] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:13:20,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:13:20,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-19 17:13:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82937597] [2023-12-19 17:13:20,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:20,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 17:13:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 17:13:20,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:13:20,884 INFO L87 Difference]: Start difference. First operand 25 states and 32 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:13:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:20,945 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-19 17:13:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 17:13:20,946 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:13:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:20,948 INFO L225 Difference]: With dead ends: 48 [2023-12-19 17:13:20,948 INFO L226 Difference]: Without dead ends: 28 [2023-12-19 17:13:20,949 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:13:20,952 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:20,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:13:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-19 17:13:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-19 17:13:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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:13:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-12-19 17:13:20,959 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2023-12-19 17:13:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:20,959 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-12-19 17:13:20,959 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:13:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-12-19 17:13:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-19 17:13:20,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:20,960 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:13:20,971 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:13:21,167 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:13:21,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:21,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1663372273, now seen corresponding path program 2 times [2023-12-19 17:13:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419377443] [2023-12-19 17:13:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:21,603 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:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:21,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419377443] [2023-12-19 17:13:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419377443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840466008] [2023-12-19 17:13:21,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:13:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:21,608 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:13:21,624 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:13:21,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:13:21,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:13:21,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-19 17:13:21,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:21,974 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:21,993 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:21,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:22,022 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:13:22,044 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:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840466008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:13:22,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:13:22,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-12-19 17:13:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393868018] [2023-12-19 17:13:22,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:22,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 17:13:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:22,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 17:13:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-19 17:13:22,047 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 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:26,065 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:30,090 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,107 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,133 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:42,162 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:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:42,311 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-12-19 17:13:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 17:13:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 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 25 [2023-12-19 17:13:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:42,312 INFO L225 Difference]: With dead ends: 41 [2023-12-19 17:13:42,312 INFO L226 Difference]: Without dead ends: 31 [2023-12-19 17:13:42,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-19 17:13:42,313 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:42,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 183 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-19 17:13:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-19 17:13:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-19 17:13:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 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:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-19 17:13:42,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 25 [2023-12-19 17:13:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:42,319 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-19 17:13:42,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 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:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-19 17:13:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-19 17:13:42,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:42,320 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:42,328 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:13:42,528 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:13:42,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:42,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1265695951, now seen corresponding path program 1 times [2023-12-19 17:13:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43267572] [2023-12-19 17:13:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:43,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43267572] [2023-12-19 17:13:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43267572] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069127392] [2023-12-19 17:13:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:43,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:43,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:43,433 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:13:43,436 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:13:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:43,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-19 17:13:43,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:43,623 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:43,691 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:43,750 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:43,754 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:43,788 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-19 17:13:43,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:43,798 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:43,810 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:13:43,811 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:43,922 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2023-12-19 17:13:43,922 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:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-12-19 17:13:43,934 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 20 [2023-12-19 17:13:43,936 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:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-19 17:13:43,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069127392] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:44,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2023-12-19 17:13:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82784150] [2023-12-19 17:13:44,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:44,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 17:13:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 17:13:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=789, Unknown=1, NotChecked=56, Total=930 [2023-12-19 17:13:44,178 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 23 states have internal predecessors, (37), 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:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:44,678 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2023-12-19 17:13:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 17:13:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 23 states have internal predecessors, (37), 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 28 [2023-12-19 17:13:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:44,680 INFO L225 Difference]: With dead ends: 45 [2023-12-19 17:13:44,680 INFO L226 Difference]: Without dead ends: 34 [2023-12-19 17:13:44,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1342, Unknown=1, NotChecked=74, Total=1560 [2023-12-19 17:13:44,682 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:44,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 263 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2023-12-19 17:13:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-19 17:13:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-12-19 17:13:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-12-19 17:13:44,688 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 28 [2023-12-19 17:13:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:44,688 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-12-19 17:13:44,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 23 states have internal predecessors, (37), 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:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-12-19 17:13:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 17:13:44,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:44,689 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, 1, 1] [2023-12-19 17:13:44,698 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:44,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:44,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:44,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -763742840, now seen corresponding path program 1 times [2023-12-19 17:13:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932569550] [2023-12-19 17:13:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:46,135 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:46,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:46,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932569550] [2023-12-19 17:13:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932569550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:46,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934184064] [2023-12-19 17:13:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:46,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:46,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:46,137 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:46,157 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:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:46,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 102 conjunts are in the unsatisfiable core [2023-12-19 17:13:46,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:46,476 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:46,489 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:46,572 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:46,579 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:46,710 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:46,715 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:46,718 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:46,815 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2023-12-19 17:13:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:46,846 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:46,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:46,851 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:46,858 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:13:46,859 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:47,143 INFO L349 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2023-12-19 17:13:47,144 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 31 treesize of output 27 [2023-12-19 17:13:47,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:47,156 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:47,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 17:13:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-19 17:13:47,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:47,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_628 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_628) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_628 .cse0))) v_ArrVal_628)))) is different from false [2023-12-19 17:13:47,525 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_21| Int)) (or (= (select (select (store |c_#memory_int#1| v_subst_2 v_ArrVal_628) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_628 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_21| 4))) (store (select |c_#memory_int#1| v_subst_2) .cse0 (select v_ArrVal_628 .cse0))))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_21| (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))))) is different from false [2023-12-19 17:13:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934184064] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:47,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2023-12-19 17:13:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766805556] [2023-12-19 17:13:47,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:47,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-19 17:13:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-19 17:13:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1272, Unknown=18, NotChecked=222, Total=1640 [2023-12-19 17:13:47,656 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 37 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 6 states have call successors, (6), 3 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:13:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:48,393 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-19 17:13:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 17:13:48,393 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 6 states have call successors, (6), 3 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:13:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:48,394 INFO L225 Difference]: With dead ends: 56 [2023-12-19 17:13:48,394 INFO L226 Difference]: Without dead ends: 54 [2023-12-19 17:13:48,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=229, Invalid=2214, Unknown=19, NotChecked=294, Total=2756 [2023-12-19 17:13:48,396 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 65 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:48,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 265 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2023-12-19 17:13:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-19 17:13:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2023-12-19 17:13:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-12-19 17:13:48,403 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2023-12-19 17:13:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:48,404 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-12-19 17:13:48,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 6 states have call successors, (6), 3 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:13:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-12-19 17:13:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-19 17:13:48,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:48,406 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, 1, 1, 1] [2023-12-19 17:13:48,419 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:48,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:48,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:48,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2093721238, now seen corresponding path program 1 times [2023-12-19 17:13:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301576444] [2023-12-19 17:13:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 17:13:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301576444] [2023-12-19 17:13:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301576444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:13:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:13:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 17:13:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709877172] [2023-12-19 17:13:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:13:48,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 17:13:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:48,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 17:13:48,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:13:48,755 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:13:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:48,811 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-12-19 17:13:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 17:13:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-12-19 17:13:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:48,812 INFO L225 Difference]: With dead ends: 51 [2023-12-19 17:13:48,812 INFO L226 Difference]: Without dead ends: 46 [2023-12-19 17:13:48,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 17:13:48,813 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:48,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:13:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-19 17:13:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-12-19 17:13:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-12-19 17:13:48,820 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 33 [2023-12-19 17:13:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-12-19 17:13:48,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:13:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-12-19 17:13:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:13:48,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:48,822 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, 1, 1] [2023-12-19 17:13:48,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 17:13:48,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:48,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2033027363, now seen corresponding path program 2 times [2023-12-19 17:13:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019380238] [2023-12-19 17:13:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019380238] [2023-12-19 17:13:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019380238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703786076] [2023-12-19 17:13:50,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:13:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:50,149 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:50,172 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:50,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:13:50,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:13:50,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 138 conjunts are in the unsatisfiable core [2023-12-19 17:13:50,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:50,383 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:50,438 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:50,577 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:50,652 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:13:50,653 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:50,665 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:50,734 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:50,743 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 27 treesize of output 15 [2023-12-19 17:13:50,758 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:50,962 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:13:50,962 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2023-12-19 17:13:50,968 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:50,972 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:13:50,975 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:13:51,111 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|)))))) is different from true [2023-12-19 17:13:51,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:51,145 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:13:51,146 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2023-12-19 17:13:51,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:51,166 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:13:51,167 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 28 treesize of output 30 [2023-12-19 17:13:51,173 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 20 treesize of output 15 [2023-12-19 17:13:51,179 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 20 treesize of output 15 [2023-12-19 17:13:51,431 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:13:51,558 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:13:51,558 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-19 17:13:51,670 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:51,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:13:51,754 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 35 treesize of output 27 [2023-12-19 17:13:51,763 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:13:51,763 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:13:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-19 17:13:51,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:52,166 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 4))) v_ArrVal_894) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.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:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703786076] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:52,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:13:52,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2023-12-19 17:13:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350298958] [2023-12-19 17:13:52,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:13:52,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-19 17:13:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:13:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-19 17:13:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1822, Unknown=36, NotChecked=174, Total=2162 [2023-12-19 17:13:52,316 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 39 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:13:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:13:53,806 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2023-12-19 17:13:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 17:13:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 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:13:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:13:53,808 INFO L225 Difference]: With dead ends: 88 [2023-12-19 17:13:53,808 INFO L226 Difference]: Without dead ends: 73 [2023-12-19 17:13:53,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=277, Invalid=3477, Unknown=36, NotChecked=242, Total=4032 [2023-12-19 17:13:53,810 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:13:53,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 325 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 746 Invalid, 0 Unknown, 68 Unchecked, 0.5s Time] [2023-12-19 17:13:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-19 17:13:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2023-12-19 17:13:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-19 17:13:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-12-19 17:13:53,819 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 34 [2023-12-19 17:13:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:13:53,819 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-12-19 17:13:53,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:13:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-12-19 17:13:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-19 17:13:53,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:13:53,820 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, 1] [2023-12-19 17:13:53,828 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:54,029 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:54,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:13:54,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:13:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2074439326, now seen corresponding path program 1 times [2023-12-19 17:13:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:13:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751962400] [2023-12-19 17:13:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:13:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:13:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:13:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:13:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:13:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:13:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751962400] [2023-12-19 17:13:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751962400] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:13:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144980745] [2023-12-19 17:13:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:13:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:13:56,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:13:56,369 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:56,402 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:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:13:56,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 150 conjunts are in the unsatisfiable core [2023-12-19 17:13:56,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:13:56,590 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:56,633 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:56,751 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:56,756 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:56,761 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:57,019 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:13:57,020 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:57,030 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:57,038 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:57,043 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:57,112 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 27 treesize of output 26 [2023-12-19 17:13:57,118 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:57,126 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 33 treesize of output 17 [2023-12-19 17:13:57,308 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-19 17:13:57,308 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 123 treesize of output 38 [2023-12-19 17:13:57,319 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 25 treesize of output 7 [2023-12-19 17:13:57,323 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:57,327 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:57,383 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|))))) is different from true [2023-12-19 17:13:57,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:13:57,407 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:13:57,407 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 131 treesize of output 102 [2023-12-19 17:13:57,427 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:13:57,427 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:57,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2023-12-19 17:13:57,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:57,936 INFO L349 Elim1Store]: treesize reduction 182, result has 30.5 percent of original size [2023-12-19 17:13:57,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 151 [2023-12-19 17:13:57,989 INFO L349 Elim1Store]: treesize reduction 113, result has 30.7 percent of original size [2023-12-19 17:13:57,990 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 154 treesize of output 93 [2023-12-19 17:13:58,028 INFO L349 Elim1Store]: treesize reduction 53, result has 45.9 percent of original size [2023-12-19 17:13:58,028 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 1 case distinctions, treesize of input 41 treesize of output 49 [2023-12-19 17:13:58,126 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 130 treesize of output 98 [2023-12-19 17:13:58,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 74 [2023-12-19 17:13:58,558 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-12-19 17:13:58,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 123 [2023-12-19 17:13:58,622 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-12-19 17:13:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2023-12-19 17:13:59,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-12-19 17:13:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-19 17:13:59,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:13:59,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1075 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1075 .cse1)) v_ArrVal_1075)) (forall ((v_ArrVal_1077 Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse8 .cse1 v_ArrVal_1077)))) (let ((.cse2 (select (select .cse4 .cse6) .cse7)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse5 .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1075) .cse2) .cse3)) (= (select (select .cse4 .cse2) (+ .cse3 4)) 0))))))) (forall ((v_ArrVal_1075 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1075 .cse1)) v_ArrVal_1075)) (forall ((v_ArrVal_1077 Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse5 .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse8 .cse1 v_ArrVal_1077)) .cse6) .cse7)) (.cse10 (select (select .cse11 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1075) .cse9) .cse10)) (= (select (select .cse11 .cse9) (+ .cse10 4)) 0))))))))) is different from false [2023-12-19 17:14:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144980745] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:01,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:14:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 51 [2023-12-19 17:14:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866538220] [2023-12-19 17:14:01,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:01,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-19 17:14:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:01,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-19 17:14:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3347, Unknown=2, NotChecked=234, Total=3782 [2023-12-19 17:14:01,118 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 3 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:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:04,401 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2023-12-19 17:14:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-19 17:14:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 3 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 35 [2023-12-19 17:14:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:04,402 INFO L225 Difference]: With dead ends: 99 [2023-12-19 17:14:04,402 INFO L226 Difference]: Without dead ends: 97 [2023-12-19 17:14:04,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=572, Invalid=7990, Unknown=2, NotChecked=366, Total=8930 [2023-12-19 17:14:04,404 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 155 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:04,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 389 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1139 Invalid, 0 Unknown, 105 Unchecked, 0.8s Time] [2023-12-19 17:14:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-19 17:14:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 60. [2023-12-19 17:14:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-19 17:14:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-12-19 17:14:04,415 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 35 [2023-12-19 17:14:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:04,416 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-12-19 17:14:04,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 3 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:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-12-19 17:14:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-19 17:14:04,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:04,417 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, 1, 1, 1, 1] [2023-12-19 17:14:04,430 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:14:04,624 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:14:04,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:04,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:04,625 INFO L85 PathProgramCache]: Analyzing trace with hash -116944832, now seen corresponding path program 1 times [2023-12-19 17:14:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983099912] [2023-12-19 17:14:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:14:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:14:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983099912] [2023-12-19 17:14:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983099912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815613922] [2023-12-19 17:14:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:06,140 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:14:06,164 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:14:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:06,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 130 conjunts are in the unsatisfiable core [2023-12-19 17:14:06,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:06,462 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:14:06,635 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:14:06,635 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:14:06,687 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:14:06,696 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:06,839 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:14:06,843 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:06,847 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:14:07,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:07,035 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 38 treesize of output 27 [2023-12-19 17:14:07,048 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:14:07,048 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 28 treesize of output 30 [2023-12-19 17:14:07,056 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 20 treesize of output 15 [2023-12-19 17:14:07,448 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-19 17:14:07,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 70 [2023-12-19 17:14:07,454 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 36 treesize of output 15 [2023-12-19 17:14:07,526 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 79 treesize of output 51 [2023-12-19 17:14:07,591 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:07,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:14:07,718 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 52 treesize of output 23 [2023-12-19 17:14:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:14:07,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:14:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815613922] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:08,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:14:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 48 [2023-12-19 17:14:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932699690] [2023-12-19 17:14:08,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:08,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-19 17:14:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-19 17:14:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3014, Unknown=3, NotChecked=0, Total=3192 [2023-12-19 17:14:08,384 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 48 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 39 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:14:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:09,846 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-12-19 17:14:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 17:14:09,847 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 39 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-19 17:14:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:09,847 INFO L225 Difference]: With dead ends: 73 [2023-12-19 17:14:09,848 INFO L226 Difference]: Without dead ends: 68 [2023-12-19 17:14:09,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=365, Invalid=5182, Unknown=3, NotChecked=0, Total=5550 [2023-12-19 17:14:09,849 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:09,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 422 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 17:14:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-19 17:14:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-12-19 17:14:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-19 17:14:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-12-19 17:14:09,862 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 36 [2023-12-19 17:14:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:09,862 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-12-19 17:14:09,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 39 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:14:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-12-19 17:14:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 17:14:09,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:09,863 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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:14:09,880 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:14:10,076 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:14:10,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:10,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash -661809720, now seen corresponding path program 2 times [2023-12-19 17:14:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722300189] [2023-12-19 17:14:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:14:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:14:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722300189] [2023-12-19 17:14:12,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722300189] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218764113] [2023-12-19 17:14:12,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:14:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:12,760 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:14:12,761 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:14:12,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:14:12,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:14:12,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 149 conjunts are in the unsatisfiable core [2023-12-19 17:14:12,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:12,953 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:13,067 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:13,073 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:13,213 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 17:14:13,213 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 16 treesize of output 15 [2023-12-19 17:14:13,229 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:14:13,230 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:13,236 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:14:13,292 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 27 treesize of output 26 [2023-12-19 17:14:13,299 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 33 treesize of output 17 [2023-12-19 17:14:13,435 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-19 17:14:13,435 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 102 treesize of output 31 [2023-12-19 17:14:13,439 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 25 treesize of output 7 [2023-12-19 17:14:13,442 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:13,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:13,523 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-19 17:14:13,524 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 62 [2023-12-19 17:14:13,539 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:14:13,539 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:14:13,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2023-12-19 17:14:14,045 INFO L349 Elim1Store]: treesize reduction 196, result has 23.4 percent of original size [2023-12-19 17:14:14,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 148 treesize of output 101 [2023-12-19 17:14:14,085 INFO L349 Elim1Store]: treesize reduction 158, result has 24.8 percent of original size [2023-12-19 17:14:14,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 70 [2023-12-19 17:14:14,366 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 292 treesize of output 236 [2023-12-19 17:14:14,370 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 240 treesize of output 200 [2023-12-19 17:14:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 17:14:15,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:14:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218764113] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:25,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:14:25,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2023-12-19 17:14:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253269805] [2023-12-19 17:14:25,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:25,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-19 17:14:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-19 17:14:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3578, Unknown=1, NotChecked=0, Total=3782 [2023-12-19 17:14:25,413 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 50 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-19 17:14:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:32,449 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2023-12-19 17:14:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-19 17:14:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-12-19 17:14:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:32,450 INFO L225 Difference]: With dead ends: 86 [2023-12-19 17:14:32,450 INFO L226 Difference]: Without dead ends: 78 [2023-12-19 17:14:32,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=420, Invalid=6059, Unknown=1, NotChecked=0, Total=6480 [2023-12-19 17:14:32,452 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:32,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 411 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-19 17:14:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-19 17:14:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2023-12-19 17:14:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-19 17:14:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-12-19 17:14:32,468 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 38 [2023-12-19 17:14:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:32,469 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-12-19 17:14:32,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-19 17:14:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-12-19 17:14:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-19 17:14:32,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:32,470 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:14:32,480 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:14:32,677 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:14:32,678 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:32,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash 958680662, now seen corresponding path program 2 times [2023-12-19 17:14:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544140306] [2023-12-19 17:14:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:14:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:14:35,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544140306] [2023-12-19 17:14:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544140306] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228411135] [2023-12-19 17:14:35,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:14:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:35,008 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:14:35,009 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:14:35,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:14:35,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:14:35,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 159 conjunts are in the unsatisfiable core [2023-12-19 17:14:35,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:35,266 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:14:35,554 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (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:35,557 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (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:35,575 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:35,582 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:35,588 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |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_sll_create_~head~0#1.offset| 0)) is different from false [2023-12-19 17:14:35,592 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |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_sll_create_~head~0#1.offset| 0)) is different from true [2023-12-19 17:14:35,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from false [2023-12-19 17:14:35,677 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2023-12-19 17:14:35,686 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 13 treesize of output 5 [2023-12-19 17:14:35,692 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:35,717 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-12-19 17:14:35,720 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-12-19 17:14:35,763 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-12-19 17:14:35,766 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-12-19 17:14:35,777 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:35,810 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0))) is different from false [2023-12-19 17:14:35,813 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0))) is different from true [2023-12-19 17:14:35,892 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:14:35,892 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:35,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:35,922 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:14:35,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from false [2023-12-19 17:14:35,977 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2023-12-19 17:14:36,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) is different from false [2023-12-19 17:14:36,106 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) is different from true [2023-12-19 17:14:36,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0))) is different from false [2023-12-19 17:14:36,230 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0))) is different from true [2023-12-19 17:14:36,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from false [2023-12-19 17:14:36,455 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from true [2023-12-19 17:14:36,623 INFO L349 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2023-12-19 17:14:36,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 171 [2023-12-19 17:14:36,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:36,631 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 115 [2023-12-19 17:14:36,674 INFO L349 Elim1Store]: treesize reduction 73, result has 45.5 percent of original size [2023-12-19 17:14:36,674 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 54 treesize of output 67 [2023-12-19 17:14:36,681 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 5 treesize of output 3 [2023-12-19 17:14:36,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse4 (+ .cse0 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= .cse0 0) (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_26| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0))) (not (= .cse2 0)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= .cse3 .cse2))))))) is different from false [2023-12-19 17:14:36,765 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse4 (+ .cse0 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= .cse0 0) (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_26| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0))) (not (= .cse2 0)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= .cse3 .cse2))))))) is different from true [2023-12-19 17:14:36,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:14:36,799 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 239 treesize of output 163 [2023-12-19 17:14:36,814 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:14:36,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 15 treesize of output 7 [2023-12-19 17:14:36,885 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (+ .cse4 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from false [2023-12-19 17:14:36,890 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (+ .cse4 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from true [2023-12-19 17:14:37,130 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-19 17:14:37,134 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-19 17:14:37,182 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0))))))) is different from false [2023-12-19 17:14:37,184 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0))))))) is different from true [2023-12-19 17:14:37,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:14:37,238 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:37,270 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-19 17:14:37,273 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-19 17:14:37,308 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from false [2023-12-19 17:14:37,311 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from true [2023-12-19 17:14:37,337 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-19 17:14:37,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 31 [2023-12-19 17:14:37,376 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1)))) is different from false [2023-12-19 17:14:37,379 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1)))) is different from true [2023-12-19 17:14:37,424 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 15 treesize of output 7 [2023-12-19 17:14:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-12-19 17:14:37,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:14:38,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:14:38,690 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 505 treesize of output 506 [2023-12-19 17:14:38,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:14:38,737 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 1 case distinctions, treesize of input 1239 treesize of output 1242 [2023-12-19 17:14:38,746 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 496 treesize of output 259 [2023-12-19 17:14:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228411135] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:39,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:14:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 49 [2023-12-19 17:14:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839407281] [2023-12-19 17:14:39,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:39,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-19 17:14:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:39,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-19 17:14:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1780, Unknown=34, NotChecked=1700, Total=3660 [2023-12-19 17:14:39,347 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 49 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 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:39,732 WARN L854 $PredicateComparison]: unable to prove that (and (= |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_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (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:39,735 WARN L876 $PredicateComparison]: unable to prove that (and (= |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_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (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:39,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-12-19 17:14:39,742 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-12-19 17:14:39,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (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_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= 1 (select |c_#valid| .cse3)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (not (= .cse4 .cse3))))) is different from false [2023-12-19 17:14:39,750 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (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_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= 1 (select |c_#valid| .cse3)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (not (= .cse4 .cse3))))) is different from true [2023-12-19 17:14:39,755 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-12-19 17:14:39,757 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-12-19 17:14:39,762 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-12-19 17:14:39,765 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-12-19 17:14:39,777 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0)))) is different from false [2023-12-19 17:14:39,782 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0)))) is different from true [2023-12-19 17:14:39,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (not (= .cse6 .cse0))))) is different from false [2023-12-19 17:14:39,800 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (not (= .cse6 .cse0))))) is different from true [2023-12-19 17:14:39,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (not (= .cse6 .cse5))))) is different from false [2023-12-19 17:14:39,814 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (not (= .cse6 .cse5))))) is different from true [2023-12-19 17:14:39,826 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from false [2023-12-19 17:14:39,831 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from true [2023-12-19 17:14:39,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from false [2023-12-19 17:14:39,846 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from true [2023-12-19 17:14:39,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse8 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (or (= .cse4 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2023-12-19 17:14:39,859 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse8 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (or (= .cse4 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2023-12-19 17:14:39,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse6 (+ .cse2 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) 0)) (= (select .cse1 0) 0) (or (= .cse2 0) (= .cse3 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (= .cse5 .cse4)))))))) is different from false [2023-12-19 17:14:39,882 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse6 (+ .cse2 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) 0)) (= (select .cse1 0) 0) (or (= .cse2 0) (= .cse3 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (= .cse5 .cse4)))))))) is different from true [2023-12-19 17:14:39,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from false [2023-12-19 17:14:39,891 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from true [2023-12-19 17:14:39,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from false [2023-12-19 17:14:39,900 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from true [2023-12-19 17:14:39,904 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-19 17:14:39,907 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-19 17:14:39,912 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) 0))) is different from false [2023-12-19 17:14:39,916 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) 0))) is different from true [2023-12-19 17:14:39,922 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)))) is different from false [2023-12-19 17:14:39,924 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)))) is different from true [2023-12-19 17:14:39,928 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-12-19 17:14:39,931 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-12-19 17:14:39,935 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from false [2023-12-19 17:14:39,938 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from true [2023-12-19 17:14:39,944 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1))))) is different from false [2023-12-19 17:14:39,946 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1))))) is different from true [2023-12-19 17:14:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:40,160 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-12-19 17:14:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-19 17:14:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 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 39 [2023-12-19 17:14:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:40,162 INFO L225 Difference]: With dead ends: 77 [2023-12-19 17:14:40,162 INFO L226 Difference]: Without dead ends: 75 [2023-12-19 17:14:40,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=198, Invalid=1946, Unknown=74, NotChecked=4588, Total=6806 [2023-12-19 17:14:40,164 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1745 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:40,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 337 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 1745 Unchecked, 0.4s Time] [2023-12-19 17:14:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-19 17:14:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-19 17:14:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-19 17:14:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-12-19 17:14:40,183 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 39 [2023-12-19 17:14:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:40,183 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-12-19 17:14:40,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 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:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-12-19 17:14:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-19 17:14:40,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:40,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:14:40,198 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:40,394 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:40,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:40,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1008327703, now seen corresponding path program 3 times [2023-12-19 17:14:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492262315] [2023-12-19 17:14:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:14:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-19 17:14:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-19 17:14:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492262315] [2023-12-19 17:14:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492262315] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879790332] [2023-12-19 17:14:40,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 17:14:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:40,533 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:40,536 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:40,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-19 17:14:40,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:14:40,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 17:14:40,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 17:14:40,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 17:14:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879790332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:14:40,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 17:14:40,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-12-19 17:14:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913788837] [2023-12-19 17:14:40,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:14:40,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 17:14:40,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:40,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 17:14:40,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 17:14:40,955 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 17:14:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:40,994 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-12-19 17:14:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 17:14:40,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2023-12-19 17:14:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:40,995 INFO L225 Difference]: With dead ends: 83 [2023-12-19 17:14:40,995 INFO L226 Difference]: Without dead ends: 38 [2023-12-19 17:14:40,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 17:14:40,995 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:40,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:14:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-19 17:14:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-19 17:14:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.0) internal successors, (32), 32 states have internal predecessors, (32), 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:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2023-12-19 17:14:41,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 40 [2023-12-19 17:14:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:41,003 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2023-12-19 17:14:41,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 17:14:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2023-12-19 17:14:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-19 17:14:41,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:14:41,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:14:41,010 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:41,204 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:41,205 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:14:41,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:14:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash -345669062, now seen corresponding path program 1 times [2023-12-19 17:14:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:14:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24063608] [2023-12-19 17:14:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:14:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:41,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:14:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:14:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:14:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 17:14:41,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:14:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24063608] [2023-12-19 17:14:41,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24063608] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:14:41,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181694038] [2023-12-19 17:14:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:14:41,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:14:41,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:14:41,399 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:41,401 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:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:14:41,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-19 17:14:41,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:14:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 17:14:41,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:14:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 17:14:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181694038] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:14:41,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:14:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-12-19 17:14:41,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852245347] [2023-12-19 17:14:41,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:14:41,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 17:14:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:14:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 17:14:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-19 17:14:41,779 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:14:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:14:41,881 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2023-12-19 17:14:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 17:14:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2023-12-19 17:14:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:14:41,881 INFO L225 Difference]: With dead ends: 38 [2023-12-19 17:14:41,881 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 17:14:41,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-19 17:14:41,882 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:14:41,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:14:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 17:14:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 17:14:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:14:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 17:14:41,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2023-12-19 17:14:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:14:41,883 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 17:14:41,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:14:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 17:14:41,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 17:14:41,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 17:14:41,892 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:14:42,092 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:14:42,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 17:14:45,938 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse21 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_append_~head#1.base|) 0)) (.cse3 (select (select |#memory_$Pointer$#1.base| .cse11) 4))) (let ((.cse0 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= .cse11 0))) (.cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse22 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse22 (select |v_old(#valid)_AFTER_CALL_26| .cse22)))) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse11) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse11) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 1)))) (.cse17 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse4 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse6 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |ULTIMATE.start_main_~uneq~0#1|)) (.cse7 (= |ULTIMATE.start_sll_append_~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) (.cse10 (= (select |#valid| .cse3) 1)) (.cse12 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse14 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse15 (= (select (select |#memory_int#1| .cse11) 0) 1)) (.cse16 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse18 (= (select |#valid| .cse21) 1)) (.cse19 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse20 (not (= .cse3 0)))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$#1.offset| .cse3) 4) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse12 .cse13 .cse14 .cse15 .cse16 (= (select (select |#memory_$Pointer$#1.base| .cse17) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse11) 4) 0) .cse18 .cse19 .cse20 (= (select (select |#memory_int#1| .cse17) 0) 1)) (and .cse0 .cse1 .cse2 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) 0) 1) (= .cse17 0) (= (select (select |#memory_$Pointer$#1.offset| (select (select |#memory_$Pointer$#1.base| .cse21) 4)) 4) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse3) .cse18 .cse19 (= (select (select |#memory_$Pointer$#1.offset| .cse21) 4) 0) .cse20))))) [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L622(lines 622 624) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 611 640) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse7 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse8 (not .cse1)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse10 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse11 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse12 (= .cse6 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select (select |#memory_$Pointer$#1.base| .cse6) 4) 0) .cse7 .cse8 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |#valid| .cse9))) |#valid|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_sll_create_~head~0#1.base|) 0))) .cse0 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse10 (= (select (select |#memory_int#1| .cse6) 0) 1) .cse11 .cse2 .cse3 .cse4 .cse5 (not .cse12) (= (select (select |#memory_$Pointer$#1.offset| .cse6) 4) 0)) (and .cse7 .cse8 .cse0 .cse10 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse11 .cse12 .cse2 .cse3 .cse4 .cse5)))) [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 638) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 632) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not .cse1) .cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~len#1| 1) (= (select (select |#memory_int#1| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse2 .cse3 .cse4 .cse5))) [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 611 640) no Hoare annotation was computed. [2023-12-19 17:14:45,939 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 17:14:45,940 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2023-12-19 17:14:45,940 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 630) no Hoare annotation was computed. [2023-12-19 17:14:45,940 INFO L899 garLoopResultBuilder]: For program point L620-1(lines 620 627) no Hoare annotation was computed. [2023-12-19 17:14:45,940 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 17:14:45,940 INFO L895 garLoopResultBuilder]: At program point L620-3(lines 620 627) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse35 (select .cse17 0))) (let ((.cse37 (select (select |#memory_$Pointer$#1.base| .cse35) 4))) (let ((.cse13 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (select (select |#memory_$Pointer$#1.base| .cse37) 4))) (let ((.cse30 (select (select |#memory_int#1| |ULTIMATE.start_main_~ptr~0#1.base|) 0)) (.cse22 (= (select (select |#memory_$Pointer$#1.offset| .cse37) 4) 0)) (.cse23 (not (= .cse38 0))) (.cse8 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse27 (= (select .cse13 0) 0)) (.cse21 (select (select |#memory_int#1| .cse37) 0)) (.cse14 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1|) 0) 0)))) (.cse28 (= (select (select |#memory_$Pointer$#1.offset| .cse38) 4) 0)) (.cse29 (= (select (select |#memory_$Pointer$#1.offset| .cse35) 4) 0)) (.cse31 (= 0 (select (select |#memory_$Pointer$#1.base| .cse38) 4))) (.cse32 (not (= .cse37 0)))) (or (let ((.cse9 (select .cse17 |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| .cse9) 4))) (and (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (or (and (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0)) (= .cse0 0))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse3 (select (select |#memory_$Pointer$#1.base| .cse4) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_26| .cse2)))) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse3) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int#1| .cse3) 0)))))) (exists ((v_subst_19 Int) (v_subst_21 Int)) (let ((.cse7 (+ v_subst_21 4))) (let ((.cse5 (select (select |#memory_$Pointer$#1.base| v_subst_19) .cse7))) (let ((.cse6 (select (select |#memory_$Pointer$#1.base| .cse5) 4))) (and (not (= .cse5 v_subst_19)) (= (select (select |#memory_$Pointer$#1.base| .cse6) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| v_subst_19) .cse7) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse6) 4) 0) (not (= .cse6 v_subst_19)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse6) (= (select (select |#memory_$Pointer$#1.offset| .cse5) 4) 0) (not (= .cse6 0)) (not (= .cse5 0))))))) .cse8 (= (select (select |#memory_$Pointer$#1.offset| .cse9) 4) 0) (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_42| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_38| 4))) (let ((.cse11 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) .cse10))) (and (= 0 (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) .cse10)) (= (select (select |#memory_$Pointer$#1.offset| .cse11) 4) 0) (not (= .cse1 .cse11)) (= (select (select |#memory_$Pointer$#1.base| .cse11) 4) 0))))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) 4))) (and (= |v_ULTIMATE.start_sll_append_~last~0#1.base_42| .cse12) (= (select (select |#memory_$Pointer$#1.offset| .cse12) 4) 0))))) (= (select .cse13 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) .cse14 .cse15 .cse16 (= 2 |ULTIMATE.start_main_~count~0#1|) (not (= .cse1 0))))) (and (= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse19 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse20 (select (select |#memory_$Pointer$#1.base| .cse19) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse18 (select |v_old(#valid)_AFTER_CALL_26| .cse18)))) (= (select (select |#memory_$Pointer$#1.offset| .cse19) 4) 0) (not (= .cse20 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse19) (= (select |v_#valid_BEFORE_CALL_22| .cse19) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse20) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int#1| .cse20) 0)))))) (= .cse21 |ULTIMATE.start_main_~data~0#1|) .cse22 .cse23 (exists ((v_subst_19 Int) (v_subst_21 Int)) (let ((.cse26 (+ v_subst_21 4))) (let ((.cse24 (select (select |#memory_$Pointer$#1.base| v_subst_19) .cse26))) (let ((.cse25 (select (select |#memory_$Pointer$#1.base| .cse24) 4))) (and (not (= .cse24 v_subst_19)) (= (select (select |#memory_$Pointer$#1.base| .cse25) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| v_subst_19) .cse26) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse25) 4) 0) (not (= .cse25 v_subst_19)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse24) (= (select (select |#memory_$Pointer$#1.offset| .cse24) 4) 0) (not (= .cse24 0))))))) .cse8 .cse27 .cse14 .cse15 .cse16 .cse28 .cse29 (= |ULTIMATE.start_main_~data~0#1| .cse30) .cse31 .cse32) (let ((.cse34 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse33 (select (select |#memory_$Pointer$#1.base| .cse34) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse33) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse33) 4) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int#1| .cse33) 0)) (= .cse30 1) .cse22 (= (select (select |#memory_int#1| .cse34) 0) 1) .cse23 .cse8 .cse27 (= |ULTIMATE.start_main_~count~0#1| 0) (= .cse21 1) (not (= .cse34 0)) (not (= .cse33 0)) (= |ULTIMATE.start_main_~data~0#1| 1) .cse14 .cse15 .cse16 .cse28 (= (select (select |#memory_int#1| .cse35) 0) 1) .cse29 .cse31 (= (select (select |#memory_$Pointer$#1.offset| .cse34) 4) 0) .cse32 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse36 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse36 (select |v_old(#valid)_AFTER_CALL_26| .cse36)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse33) 0) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse34) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1)))))))))))) [2023-12-19 17:14:45,940 INFO L899 garLoopResultBuilder]: For program point L620-4(lines 620 627) no Hoare annotation was computed. [2023-12-19 17:14:45,940 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_append_~head#1.base|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| .cse4) 4)) (.cse2 (select (select |#memory_$Pointer$#1.base| .cse0) 4))) (and (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |#memory_int#1| .cse2) 0) 1) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_append_~data#1|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |#valid| .cse3))) |#valid|) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int#1| .cse0) 0) 1) (= (select |#valid| .cse4) 1) (= (select (select |#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse4) 4) 0) (not (= .cse2 0))))) [2023-12-19 17:14:45,940 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-12-19 17:14:45,941 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 611 640) no Hoare annotation was computed. [2023-12-19 17:14:45,941 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-12-19 17:14:45,941 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-19 17:14:45,941 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-19 17:14:45,941 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-12-19 17:14:45,941 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-19 17:14:45,943 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-19 17:14:45,945 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 17:14:45,956 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:347) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) 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) [2023-12-19 17:14:45,960 INFO L158 Benchmark]: Toolchain (without parser) took 87364.58ms. Allocated memory was 366.0MB in the beginning and 614.5MB in the end (delta: 248.5MB). Free memory was 315.5MB in the beginning and 482.8MB in the end (delta: -167.4MB). Peak memory consumption was 361.2MB. Max. memory is 8.0GB. [2023-12-19 17:14:45,960 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 231.7MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 17:14:45,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.88ms. Allocated memory is still 366.0MB. Free memory was 315.0MB in the beginning and 296.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 17:14:45,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.50ms. Allocated memory is still 366.0MB. Free memory was 296.7MB in the beginning and 294.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 17:14:45,965 INFO L158 Benchmark]: Boogie Preprocessor took 65.00ms. Allocated memory is still 366.0MB. Free memory was 294.6MB in the beginning and 291.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 17:14:45,966 INFO L158 Benchmark]: RCFGBuilder took 515.39ms. Allocated memory is still 366.0MB. Free memory was 291.4MB in the beginning and 272.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 17:14:45,966 INFO L158 Benchmark]: TraceAbstraction took 86334.77ms. Allocated memory was 366.0MB in the beginning and 614.5MB in the end (delta: 248.5MB). Free memory was 271.5MB in the beginning and 482.8MB in the end (delta: -211.3MB). Peak memory consumption was 317.1MB. Max. memory is 8.0GB. [2023-12-19 17:14:45,968 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.58ms. Allocated memory is still 231.7MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 399.88ms. Allocated memory is still 366.0MB. Free memory was 315.0MB in the beginning and 296.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.50ms. Allocated memory is still 366.0MB. Free memory was 296.7MB in the beginning and 294.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.00ms. Allocated memory is still 366.0MB. Free memory was 294.6MB in the beginning and 291.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 515.39ms. Allocated memory is still 366.0MB. Free memory was 291.4MB in the beginning and 272.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 86334.77ms. Allocated memory was 366.0MB in the beginning and 614.5MB in the end (delta: 248.5MB). Free memory was 271.5MB in the beginning and 482.8MB in the end (delta: -211.3MB). Peak memory consumption was 317.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 638]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 86.3s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 3056 SdHoareTripleChecker+Invalid, 24.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2015 IncrementalHoareTripleChecker+Unchecked, 2773 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5076 IncrementalHoareTripleChecker+Invalid, 7158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 283 mSDtfsCounter, 5076 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 404 SyntacticMatches, 6 SemanticMatches, 526 ConstructedPredicates, 45 IntricatePredicates, 0 DeprecatedPredicates, 5982 ImplicationChecksByTransitivity, 33.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=12, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 87 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 26 NumberOfFragments, 1892 HoareAnnotationTreeSize, 14 FormulaSimplifications, 1989 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FormulaSimplificationsInter, 2912 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 847 ConstructedInterpolants, 81 QuantifiedInterpolants, 19856 SizeOfPredicates, 220 NumberOfNonLiveVariables, 3897 ConjunctsInSsa, 932 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 277/481 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-19 17:14:46,073 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 0 Received shutdown request...