/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:46:01,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:46:01,272 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-21 03:46:01,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:46:01,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:46:01,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:46:01,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:46:01,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:46:01,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:46:01,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:46:01,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:46:01,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:46:01,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:46:01,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:46:01,309 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:46:01,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:46:01,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:46:01,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:46:01,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:46:01,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:46:01,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:46:01,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:46:01,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:46:01,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:46:01,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:46:01,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:46:01,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:46:01,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:46:01,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:46:01,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:46:01,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:46:01,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:46:01,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:46:01,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:46:01,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:46:01,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:46:01,314 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 -> false [2023-12-21 03:46:01,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:46:01,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:46:01,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:46:01,517 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:46:01,519 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:46:01,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2023-12-21 03:46:02,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:46:02,718 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:46:02,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2023-12-21 03:46:02,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fc5f254/b18a82adb76b4852ad5b843ae73fedd0/FLAG91a7458ad [2023-12-21 03:46:02,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fc5f254/b18a82adb76b4852ad5b843ae73fedd0 [2023-12-21 03:46:02,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:46:02,740 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:46:02,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:46:02,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:46:02,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:46:02,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:46:02" (1/1) ... [2023-12-21 03:46:02,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dfe2118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:02, skipping insertion in model container [2023-12-21 03:46:02,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:46:02" (1/1) ... [2023-12-21 03:46:02,794 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:46:02,985 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/sll2c_insert_equal.i[24601,24614] [2023-12-21 03:46:02,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:46:03,000 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:46:03,026 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/sll2c_insert_equal.i[24601,24614] [2023-12-21 03:46:03,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:46:03,044 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:46:03,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03 WrapperNode [2023-12-21 03:46:03,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:46:03,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:46:03,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:46:03,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:46:03,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,074 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-12-21 03:46:03,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:46:03,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:46:03,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:46:03,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:46:03,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,099 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 9, 14]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2023-12-21 03:46:03,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:46:03,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:46:03,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:46:03,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:46:03,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (1/1) ... [2023-12-21 03:46:03,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:46:03,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:03,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-21 03:46:03,147 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-21 03:46:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:46:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:46:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:46:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:46:03,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:46:03,165 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:46:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:46:03,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:46:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:46:03,259 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:46:03,261 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:46:03,410 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:46:03,431 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:46:03,431 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 03:46:03,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:46:03 BoogieIcfgContainer [2023-12-21 03:46:03,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:46:03,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:46:03,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:46:03,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:46:03,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:46:02" (1/3) ... [2023-12-21 03:46:03,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceecf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:46:03, skipping insertion in model container [2023-12-21 03:46:03,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:46:03" (2/3) ... [2023-12-21 03:46:03,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceecf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:46:03, skipping insertion in model container [2023-12-21 03:46:03,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:46:03" (3/3) ... [2023-12-21 03:46:03,437 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-12-21 03:46:03,448 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:46:03,448 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:46:03,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:46:03,479 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;@3b7aba82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:46:03,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:46:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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-21 03:46:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 03:46:03,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:03,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:03,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:03,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2023-12-21 03:46:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215910317] [2023-12-21 03:46:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:46:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215910317] [2023-12-21 03:46:03,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215910317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:46:03,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:46:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:46:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658515758] [2023-12-21 03:46:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:46:03,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:46:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:46:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:46:03,823 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-21 03:46:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:03,874 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2023-12-21 03:46:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:46:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 19 [2023-12-21 03:46:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:03,880 INFO L225 Difference]: With dead ends: 54 [2023-12-21 03:46:03,880 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 03:46:03,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 03:46:03,885 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:03,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:46:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 03:46:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-21 03:46:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:46:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-12-21 03:46:03,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2023-12-21 03:46:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:03,913 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-12-21 03:46:03,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-21 03:46:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-12-21 03:46:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 03:46:03,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:03,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:03,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:46:03,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:03,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2023-12-21 03:46:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230678152] [2023-12-21 03:46:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:46:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:04,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:04,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230678152] [2023-12-21 03:46:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230678152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:46:04,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:46:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:46:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937493400] [2023-12-21 03:46:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:46:04,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:46:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:46:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:46:04,098 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-21 03:46:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:04,141 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-12-21 03:46:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:46:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 19 [2023-12-21 03:46:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:04,142 INFO L225 Difference]: With dead ends: 43 [2023-12-21 03:46:04,142 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 03:46:04,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-21 03:46:04,144 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:04,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:46:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 03:46:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-21 03:46:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-21 03:46:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-21 03:46:04,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2023-12-21 03:46:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:04,153 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-21 03:46:04,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-21 03:46:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-21 03:46:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 03:46:04,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:04,154 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:04,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:46:04,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:04,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2023-12-21 03:46:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:04,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527714749] [2023-12-21 03:46:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:46:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527714749] [2023-12-21 03:46:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527714749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:46:04,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:46:04,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:46:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661685487] [2023-12-21 03:46:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:46:04,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:46:04,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:46:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:46:04,292 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:46:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:04,321 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-12-21 03:46:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:46:04,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-21 03:46:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:04,323 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:46:04,323 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 03:46:04,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-21 03:46:04,327 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:04,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:46:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 03:46:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-21 03:46:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-21 03:46:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-12-21 03:46:04,332 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 25 [2023-12-21 03:46:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:04,332 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-12-21 03:46:04,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:46:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-12-21 03:46:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 03:46:04,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:04,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:04,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:46:04,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:04,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2023-12-21 03:46:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704610264] [2023-12-21 03:46:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704610264] [2023-12-21 03:46:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704610264] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808148269] [2023-12-21 03:46:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:05,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:05,772 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-21 03:46:05,788 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-21 03:46:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:05,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 101 conjunts are in the unsatisfiable core [2023-12-21 03:46:05,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:06,055 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-21 03:46:06,259 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-21 03:46:06,323 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:46:06,325 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-21 03:46:06,380 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-21 03:46:06,465 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-21 03:46:06,553 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-21 03:46:06,557 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-21 03:46:06,721 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-21 03:46:06,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-21 03:46:06,731 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-21 03:46:06,925 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-21 03:46:06,929 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-21 03:46:06,980 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-21 03:46:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:46:07,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:46:07,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808148269] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:07,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:46:07,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-12-21 03:46:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594156874] [2023-12-21 03:46:07,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:46:07,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 03:46:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 03:46:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1980, Unknown=26, NotChecked=0, Total=2162 [2023-12-21 03:46:07,425 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:46:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:08,233 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-12-21 03:46:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 03:46:08,233 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-12-21 03:46:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:08,235 INFO L225 Difference]: With dead ends: 48 [2023-12-21 03:46:08,235 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 03:46:08,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=3347, Unknown=26, NotChecked=0, Total=3660 [2023-12-21 03:46:08,237 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 64 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:08,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 265 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 03:46:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 03:46:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-12-21 03:46:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-21 03:46:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-12-21 03:46:08,243 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 26 [2023-12-21 03:46:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:08,243 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-12-21 03:46:08,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:46:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2023-12-21 03:46:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:46:08,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:08,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:08,267 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-21 03:46:08,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:08,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:08,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2023-12-21 03:46:08,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:08,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817325791] [2023-12-21 03:46:08,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:08,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:46:08,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:08,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817325791] [2023-12-21 03:46:08,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817325791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:46:08,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:46:08,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 03:46:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653066433] [2023-12-21 03:46:08,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:46:08,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:46:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:08,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:46:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:46:08,581 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:46:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:08,617 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-21 03:46:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:46:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-12-21 03:46:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:08,619 INFO L225 Difference]: With dead ends: 43 [2023-12-21 03:46:08,619 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:46:08,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:46:08,619 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:08,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:46:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:46:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-21 03:46:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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-21 03:46:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-12-21 03:46:08,629 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2023-12-21 03:46:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:08,629 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-12-21 03:46:08,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:46:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-12-21 03:46:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:46:08,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:08,630 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:08,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:46:08,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1881720096, now seen corresponding path program 1 times [2023-12-21 03:46:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028832117] [2023-12-21 03:46:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:46:08,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028832117] [2023-12-21 03:46:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028832117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:46:08,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:46:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:46:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450891446] [2023-12-21 03:46:08,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:46:08,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:46:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:46:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:46:08,720 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:46:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:08,753 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-12-21 03:46:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:46:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-12-21 03:46:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:08,755 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:46:08,755 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 03:46:08,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:46:08,755 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:08,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:46:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 03:46:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 03:46:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-21 03:46:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-12-21 03:46:08,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2023-12-21 03:46:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:08,763 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-12-21 03:46:08,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:46:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-12-21 03:46:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:46:08,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:08,764 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:08,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 03:46:08,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:08,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2023-12-21 03:46:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:08,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322736458] [2023-12-21 03:46:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:08,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:09,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322736458] [2023-12-21 03:46:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322736458] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604351845] [2023-12-21 03:46:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:09,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:09,152 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-21 03:46:09,175 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-21 03:46:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:09,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-21 03:46:09,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:09,302 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-21 03:46:09,381 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:46:09,382 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-21 03:46:09,410 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-21 03:46:09,452 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-21 03:46:09,452 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 70 treesize of output 57 [2023-12-21 03:46:09,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2023-12-21 03:46:09,485 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-21 03:46:09,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:46:09,551 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 46 treesize of output 35 [2023-12-21 03:46:09,562 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-12-21 03:46:09,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-21 03:46:09,647 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2023-12-21 03:46:09,647 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 1 case distinctions, treesize of input 53 treesize of output 59 [2023-12-21 03:46:09,664 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-21 03:46:09,664 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 3 case distinctions, treesize of input 68 treesize of output 74 [2023-12-21 03:46:09,674 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 22 treesize of output 16 [2023-12-21 03:46:09,689 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-21 03:46:09,716 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 35 treesize of output 19 [2023-12-21 03:46:09,717 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-21 03:46:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:46:09,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:46:09,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| Int) (v_ArrVal_783 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|) 0)) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_783) |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_779) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0))))) is different from false [2023-12-21 03:46:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604351845] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:09,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:46:09,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 30 [2023-12-21 03:46:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092264814] [2023-12-21 03:46:09,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:46:09,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 03:46:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 03:46:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=948, Unknown=24, NotChecked=62, Total=1122 [2023-12-21 03:46:09,927 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:46:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:10,492 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2023-12-21 03:46:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 03:46:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-21 03:46:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:10,493 INFO L225 Difference]: With dead ends: 55 [2023-12-21 03:46:10,493 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 03:46:10,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1961, Unknown=24, NotChecked=90, Total=2256 [2023-12-21 03:46:10,494 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:10,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 278 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 03:46:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 03:46:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2023-12-21 03:46:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:46:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-21 03:46:10,499 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2023-12-21 03:46:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:10,499 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-21 03:46:10,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:46:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-21 03:46:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:46:10,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:10,500 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:10,507 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-21 03:46:10,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-21 03:46:10,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:10,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2023-12-21 03:46:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:10,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908543001] [2023-12-21 03:46:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:10,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:10,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:46:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908543001] [2023-12-21 03:46:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908543001] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484064512] [2023-12-21 03:46:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:10,791 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-21 03:46:10,819 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-21 03:46:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:10,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 03:46:10,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:46:10,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:46:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:46:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484064512] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:46:11,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:46:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-12-21 03:46:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313402712] [2023-12-21 03:46:11,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:46:11,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 03:46:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:11,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 03:46:11,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:46:11,013 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:46:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:11,068 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-12-21 03:46:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 03:46:11,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-12-21 03:46:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:11,069 INFO L225 Difference]: With dead ends: 40 [2023-12-21 03:46:11,069 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:46:11,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:46:11,070 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:11,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:46:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:46:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-21 03:46:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-21 03:46:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-12-21 03:46:11,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2023-12-21 03:46:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:11,074 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-12-21 03:46:11,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:46:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-12-21 03:46:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:46:11,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:11,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:11,086 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-21 03:46:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:11,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:11,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash 208832784, now seen corresponding path program 1 times [2023-12-21 03:46:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791129419] [2023-12-21 03:46:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:46:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791129419] [2023-12-21 03:46:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791129419] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931319841] [2023-12-21 03:46:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:11,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:11,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:11,501 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-21 03:46:11,519 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-21 03:46:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:11,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 03:46:11,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:11,751 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-21 03:46:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:46:11,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:46:11,798 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-21 03:46:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:46:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931319841] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:46:11,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:46:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-12-21 03:46:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486086674] [2023-12-21 03:46:11,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:46:11,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 03:46:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 03:46:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-12-21 03:46:11,814 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 03:46:15,818 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-21 03:46:19,827 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-21 03:46:23,835 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-21 03:46:27,860 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-21 03:46:32,004 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-21 03:46:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:32,008 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-12-21 03:46:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 03:46:32,008 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 28 [2023-12-21 03:46:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:32,009 INFO L225 Difference]: With dead ends: 40 [2023-12-21 03:46:32,009 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 03:46:32,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2023-12-21 03:46:32,010 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:32,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 209 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-21 03:46:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 03:46:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-21 03:46:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:46:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-21 03:46:32,014 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 28 [2023-12-21 03:46:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:32,014 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-21 03:46:32,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 03:46:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-21 03:46:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:46:32,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:32,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:32,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 03:46:32,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:32,215 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:32,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2023-12-21 03:46:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690852131] [2023-12-21 03:46:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:33,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690852131] [2023-12-21 03:46:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690852131] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102290309] [2023-12-21 03:46:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:33,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:33,006 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-21 03:46:33,008 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-21 03:46:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:33,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 157 conjunts are in the unsatisfiable core [2023-12-21 03:46:33,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:33,388 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-21 03:46:33,416 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-21 03:46:33,646 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:46:33,647 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 16 treesize of output 15 [2023-12-21 03:46:33,666 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:46:33,666 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-21 03:46:33,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-21 03:46:33,732 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-21 03:46:33,739 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-21 03:46:33,833 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-21 03:46:33,833 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 132 treesize of output 83 [2023-12-21 03:46:33,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:46:33,840 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 55 treesize of output 19 [2023-12-21 03:46:33,849 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-21 03:46:33,918 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 45 treesize of output 21 [2023-12-21 03:46:33,932 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-21 03:46:33,937 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-21 03:46:33,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:46:34,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-21 03:46:34,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:46:34,129 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 53 treesize of output 36 [2023-12-21 03:46:34,142 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-21 03:46:34,142 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 24 treesize of output 31 [2023-12-21 03:46:34,160 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:46:34,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:46:34,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:46:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:46:34,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-12-21 03:46:34,511 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 36 treesize of output 23 [2023-12-21 03:46:34,515 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 68 treesize of output 39 [2023-12-21 03:46:34,524 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-21 03:46:34,524 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 1 case distinctions, treesize of input 105 treesize of output 68 [2023-12-21 03:46:34,527 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-21 03:46:34,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-12-21 03:46:34,603 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 70 treesize of output 42 [2023-12-21 03:46:34,686 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 35 treesize of output 19 [2023-12-21 03:46:34,692 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-21 03:46:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:46:34,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:46:34,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1297))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1296 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1296)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1296) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1295) .cse1) .cse2) 4))))))) is different from false [2023-12-21 03:46:35,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_1297))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1296) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300) .cse3) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1295) .cse3) .cse4) 4)))) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1296 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1296)))))) is different from false [2023-12-21 03:46:35,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:46:35,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-12-21 03:46:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102290309] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:35,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:46:35,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 38 [2023-12-21 03:46:35,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86326636] [2023-12-21 03:46:35,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:46:35,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 03:46:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:35,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 03:46:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1644, Unknown=41, NotChecked=166, Total=1980 [2023-12-21 03:46:35,202 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 38 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 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-21 03:46:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:36,542 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-12-21 03:46:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 03:46:36,543 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 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 29 [2023-12-21 03:46:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:36,544 INFO L225 Difference]: With dead ends: 58 [2023-12-21 03:46:36,545 INFO L226 Difference]: Without dead ends: 56 [2023-12-21 03:46:36,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=327, Invalid=4171, Unknown=66, NotChecked=266, Total=4830 [2023-12-21 03:46:36,546 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:36,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 214 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 03:46:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-21 03:46:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 31. [2023-12-21 03:46:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-21 03:46:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-12-21 03:46:36,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2023-12-21 03:46:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:36,552 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-12-21 03:46:36,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 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-21 03:46:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-12-21 03:46:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 03:46:36,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:36,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:36,563 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-21 03:46:36,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 03:46:36,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:36,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash 479766182, now seen corresponding path program 1 times [2023-12-21 03:46:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394964851] [2023-12-21 03:46:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:37,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:37,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394964851] [2023-12-21 03:46:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394964851] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253069539] [2023-12-21 03:46:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:37,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:37,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:37,502 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-21 03:46:37,504 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-21 03:46:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:37,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 89 conjunts are in the unsatisfiable core [2023-12-21 03:46:37,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:37,763 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-21 03:46:37,890 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:46:37,891 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-21 03:46:37,929 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-21 03:46:37,985 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-21 03:46:37,985 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 70 treesize of output 57 [2023-12-21 03:46:38,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 38 treesize of output 14 [2023-12-21 03:46:38,024 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-21 03:46:38,090 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-12-21 03:46:38,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-21 03:46:38,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (and (not (= .cse0 .cse1)) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse1) .cse2)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 .cse3)) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse3)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) is different from false [2023-12-21 03:46:38,107 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (and (not (= .cse0 .cse1)) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse1) .cse2)) (.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 .cse3)) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse3)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) is different from true [2023-12-21 03:46:38,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-12-21 03:46:38,234 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 172 treesize of output 56 [2023-12-21 03:46:38,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 101 [2023-12-21 03:46:38,278 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 108 treesize of output 80 [2023-12-21 03:46:38,339 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 72 treesize of output 48 [2023-12-21 03:46:38,400 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 83 treesize of output 51 [2023-12-21 03:46:38,403 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:46:38,403 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 48 treesize of output 19 [2023-12-21 03:46:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:46:38,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:46:38,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:46:38,423 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2023-12-21 03:46:38,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:46:38,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 188 [2023-12-21 03:46:38,433 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 168 treesize of output 162 [2023-12-21 03:46:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253069539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:39,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:46:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 37 [2023-12-21 03:46:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715255734] [2023-12-21 03:46:39,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:46:39,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 03:46:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:46:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 03:46:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1443, Unknown=2, NotChecked=76, Total=1640 [2023-12-21 03:46:39,195 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 37 states, 30 states have (on average 1.5) internal successors, (45), 28 states have internal predecessors, (45), 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-21 03:46:39,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse3 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (not (= .cse4 .cse2)))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1 (= (select |c_#valid| .cse2) 1) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and .cse1 (not (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse2) .cse7)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse2 .cse5)) (= .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse5)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse6 (select |c_#memory_$Pointer$#2.base| .cse6)) |c_#memory_$Pointer$#2.base|))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))))))) is different from false [2023-12-21 03:46:39,427 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse3 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (not (= .cse4 .cse2)))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1 (= (select |c_#valid| .cse2) 1) (not (= (select (select |c_#memory_$Pointer$#2.base| .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and .cse1 (not (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse5 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse2) .cse7)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse2 .cse5)) (= .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse5)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_18| .cse6 (select |c_#memory_$Pointer$#2.base| .cse6)) |c_#memory_$Pointer$#2.base|))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))))))) is different from true [2023-12-21 03:46:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:46:40,123 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-12-21 03:46:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 03:46:40,123 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.5) internal successors, (45), 28 states have internal predecessors, (45), 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 31 [2023-12-21 03:46:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:46:40,124 INFO L225 Difference]: With dead ends: 59 [2023-12-21 03:46:40,124 INFO L226 Difference]: Without dead ends: 56 [2023-12-21 03:46:40,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=3261, Unknown=4, NotChecked=234, Total=3782 [2023-12-21 03:46:40,125 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 83 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:46:40,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 636 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2023-12-21 03:46:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-21 03:46:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2023-12-21 03:46:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-21 03:46:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-12-21 03:46:40,130 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 31 [2023-12-21 03:46:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:46:40,131 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-12-21 03:46:40,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.5) internal successors, (45), 28 states have internal predecessors, (45), 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-21 03:46:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-12-21 03:46:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:46:40,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:46:40,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:46:40,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 03:46:40,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:40,338 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:46:40,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:46:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1987890924, now seen corresponding path program 2 times [2023-12-21 03:46:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:46:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136515322] [2023-12-21 03:46:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:46:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:46:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:41,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:46:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:46:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:46:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:46:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:46:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:46:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136515322] [2023-12-21 03:46:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136515322] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:46:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932398237] [2023-12-21 03:46:41,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:46:41,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:46:41,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:46:41,701 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-21 03:46:41,703 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-21 03:46:41,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:46:41,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:46:41,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 162 conjunts are in the unsatisfiable core [2023-12-21 03:46:41,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:46:41,954 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-21 03:46:41,960 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-21 03:46:42,183 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:46:42,184 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 16 treesize of output 15 [2023-12-21 03:46:42,201 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:46:42,202 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-21 03:46:42,258 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-21 03:46:42,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-21 03:46:42,275 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-21 03:46:42,354 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:46:42,355 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 142 treesize of output 72 [2023-12-21 03:46:42,360 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 39 treesize of output 30 [2023-12-21 03:46:42,366 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 55 treesize of output 19 [2023-12-21 03:46:42,443 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:46:42,443 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 79 treesize of output 38 [2023-12-21 03:46:42,447 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-21 03:46:42,451 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-21 03:46:42,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:46:42,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-21 03:46:42,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:46:42,642 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:46:42,643 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 87 treesize of output 64 [2023-12-21 03:46:42,665 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-21 03:46:42,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2023-12-21 03:46:42,694 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:46:42,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:46:42,702 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 24 treesize of output 19 [2023-12-21 03:46:43,068 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-21 03:46:43,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 62 [2023-12-21 03:46:43,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-12-21 03:46:43,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2023-12-21 03:46:43,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-12-21 03:46:43,155 INFO L349 Elim1Store]: treesize reduction 114, result has 35.6 percent of original size [2023-12-21 03:46:43,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 129 treesize of output 114 [2023-12-21 03:46:43,194 INFO L349 Elim1Store]: treesize reduction 112, result has 23.3 percent of original size [2023-12-21 03:46:43,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2023-12-21 03:46:43,232 INFO L349 Elim1Store]: treesize reduction 95, result has 17.4 percent of original size [2023-12-21 03:46:43,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 115 [2023-12-21 03:46:43,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:46:43,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-21 03:46:44,659 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 854 treesize of output 574 [2023-12-21 03:46:44,695 INFO L349 Elim1Store]: treesize reduction 81, result has 28.3 percent of original size [2023-12-21 03:46:44,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 571 treesize of output 316 [2023-12-21 03:46:44,726 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2023-12-21 03:46:44,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 276 treesize of output 245 [2023-12-21 03:46:45,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:46:45,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 212 treesize of output 260 [2023-12-21 03:46:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:46:45,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:03,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:47:03,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 963 treesize of output 964 [2023-12-21 03:47:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932398237] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:03,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:47:03,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 45 [2023-12-21 03:47:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403131805] [2023-12-21 03:47:03,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:03,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-21 03:47:03,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:03,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-21 03:47:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2710, Unknown=96, NotChecked=0, Total=2970 [2023-12-21 03:47:03,715 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 45 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 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-21 03:47:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:09,849 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-12-21 03:47:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 03:47:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 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 32 [2023-12-21 03:47:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:09,849 INFO L225 Difference]: With dead ends: 63 [2023-12-21 03:47:09,849 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 03:47:09,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=339, Invalid=5236, Unknown=125, NotChecked=0, Total=5700 [2023-12-21 03:47:09,851 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 12 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:09,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 302 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1040 Invalid, 20 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 03:47:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 03:47:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2023-12-21 03:47:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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-21 03:47:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-12-21 03:47:09,862 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 32 [2023-12-21 03:47:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:09,862 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-12-21 03:47:09,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 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-21 03:47:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-12-21 03:47:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 03:47:09,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:09,863 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:09,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 03:47:10,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:10,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:10,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash -895390588, now seen corresponding path program 2 times [2023-12-21 03:47:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:10,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572039554] [2023-12-21 03:47:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:47:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:47:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572039554] [2023-12-21 03:47:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572039554] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250581688] [2023-12-21 03:47:10,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:47:10,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:10,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:10,191 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-21 03:47:10,193 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-21 03:47:10,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:47:10,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:10,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 03:47:10,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:47:10,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:47:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250581688] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:47:10,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:47:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-12-21 03:47:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003618419] [2023-12-21 03:47:10,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:10,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 03:47:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 03:47:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:47:10,508 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:47:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:10,579 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2023-12-21 03:47:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 03:47:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2023-12-21 03:47:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:10,580 INFO L225 Difference]: With dead ends: 65 [2023-12-21 03:47:10,580 INFO L226 Difference]: Without dead ends: 62 [2023-12-21 03:47:10,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:47:10,581 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:10,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:47:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-21 03:47:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2023-12-21 03:47:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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-21 03:47:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2023-12-21 03:47:10,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 34 [2023-12-21 03:47:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:10,598 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2023-12-21 03:47:10,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:47:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2023-12-21 03:47:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 03:47:10,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:10,598 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:10,604 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-21 03:47:10,800 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,SelfDestructingSolverStorable12 [2023-12-21 03:47:10,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:10,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1987263282, now seen corresponding path program 3 times [2023-12-21 03:47:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731145527] [2023-12-21 03:47:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 03:47:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:47:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731145527] [2023-12-21 03:47:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731145527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820354665] [2023-12-21 03:47:11,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:47:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:12,000 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-21 03:47:12,024 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-21 03:47:12,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 03:47:12,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:12,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 135 conjunts are in the unsatisfiable core [2023-12-21 03:47:12,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:12,317 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-21 03:47:12,459 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_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_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)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-12-21 03:47:12,461 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_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_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)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-12-21 03:47:12,485 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-21 03:47:12,491 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-21 03:47:12,495 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2023-12-21 03:47:12,497 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2023-12-21 03:47:12,533 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:47:12,534 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 72 treesize of output 42 [2023-12-21 03:47:12,550 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2023-12-21 03:47:12,550 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 39 treesize of output 30 [2023-12-21 03:47:12,563 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))))) is different from false [2023-12-21 03:47:12,565 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))))) is different from true [2023-12-21 03:47:12,578 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:47:12,578 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 48 treesize of output 23 [2023-12-21 03:47:12,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:12,583 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-21 03:47:12,595 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:47:12,597 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:47:12,618 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:47:12,619 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:47:12,643 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))))))) is different from false [2023-12-21 03:47:12,645 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))))))) is different from true [2023-12-21 03:47:12,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:12,682 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:47:12,683 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 56 treesize of output 45 [2023-12-21 03:47:12,710 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-21 03:47:12,710 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 3 case distinctions, treesize of input 35 treesize of output 73 [2023-12-21 03:47:12,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse1)) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (or (and (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse3) (and .cse3 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0))))) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-21 03:47:12,770 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse1)) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (or (and (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse3) (and .cse3 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0))))) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-21 03:47:12,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse1)) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) .cse3))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-21 03:47:12,847 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse1)) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) .cse3))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-21 03:47:12,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse0)) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0)) .cse3))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))))))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-21 03:47:12,931 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse0)) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0)) .cse3))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))))))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-21 03:47:13,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:13,054 INFO L349 Elim1Store]: treesize reduction 87, result has 7.4 percent of original size [2023-12-21 03:47:13,055 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 215 treesize of output 105 [2023-12-21 03:47:13,099 INFO L349 Elim1Store]: treesize reduction 202, result has 18.9 percent of original size [2023-12-21 03:47:13,099 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 4 case distinctions, treesize of input 183 treesize of output 137 [2023-12-21 03:47:13,148 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-21 03:47:13,151 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-21 03:47:13,207 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-21 03:47:13,219 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-21 03:47:13,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_old(#valid)_AFTER_CALL_27| .cse5)))))) (or .cse0 (= 0 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-21 03:47:13,328 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_old(#valid)_AFTER_CALL_27| .cse5)))))) (or .cse0 (= 0 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-21 03:47:13,498 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse2 (select .cse7 0)) (.cse0 (= .cse4 .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0))) (and (or .cse0 (and (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse4)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (or .cse0 (= 0 .cse3)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse7 .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_#valid_BEFORE_CALL_23| .cse9))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))))) is different from false [2023-12-21 03:47:13,501 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse2 (select .cse7 0)) (.cse0 (= .cse4 .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0))) (and (or .cse0 (and (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse4)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (or .cse0 (= 0 .cse3)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse7 .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_#valid_BEFORE_CALL_23| .cse9))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))))) is different from true [2023-12-21 03:47:13,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:47:13,638 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 269 treesize of output 181 [2023-12-21 03:47:13,663 INFO L349 Elim1Store]: treesize reduction 114, result has 5.8 percent of original size [2023-12-21 03:47:13,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 88 [2023-12-21 03:47:13,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:13,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:13,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:13,679 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-12-21 03:47:13,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 34 [2023-12-21 03:47:13,700 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:47:13,700 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-21 03:47:13,707 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (exists ((v_arrayElimIndex_20 Int) (v_arrayElimIndex_19 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_19) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimIndex_20) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0))))))) is different from false [2023-12-21 03:47:13,708 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (exists ((v_arrayElimIndex_20 Int) (v_arrayElimIndex_19 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_19) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimIndex_20) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0))))))) is different from true [2023-12-21 03:47:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-12-21 03:47:13,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820354665] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:14,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:47:14,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2023-12-21 03:47:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056447685] [2023-12-21 03:47:14,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:14,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 03:47:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 03:47:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1042, Unknown=28, NotChecked=1078, Total=2256 [2023-12-21 03:47:14,268 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 41 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 32 states have internal predecessors, (53), 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-21 03:47:14,453 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_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_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)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-12-21 03:47:14,455 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_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_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)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-12-21 03:47:14,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select .cse2 0) 0) (= (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2023-12-21 03:47:14,459 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select .cse2 0) 0) (= (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2023-12-21 03:47:14,462 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (not (= .cse2 .cse3)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) .cse4) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse4)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select .cse6 0) 0) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= |c_#valid| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |c_#valid| .cse7)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0))))))) is different from false [2023-12-21 03:47:14,463 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (not (= .cse2 .cse3)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) .cse4) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse4)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select .cse6 0) 0) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= |c_#valid| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |c_#valid| .cse7)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0))))))) is different from true [2023-12-21 03:47:14,469 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:47:14,470 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:47:14,473 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-21 03:47:14,474 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-21 03:47:14,483 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))))))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-12-21 03:47:14,486 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))))))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-12-21 03:47:14,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (not (= .cse0 .cse3)) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse2)) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse5) .cse5) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse7 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse7) (and .cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0))))) (= .cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse5)) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_#valid_BEFORE_CALL_23| .cse9))))))) (= (select .cse10 0) 0))))) is different from false [2023-12-21 03:47:14,505 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (not (= .cse0 .cse3)) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse3)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse2)) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse5) .cse5) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse7 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse7) (and .cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0))))) (= .cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse5)) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_#valid_BEFORE_CALL_23| .cse9))))))) (= (select .cse10 0) 0))))) is different from true [2023-12-21 03:47:14,513 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse10 0)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse4)) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_old(#valid)_AFTER_CALL_27| .cse5)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) .cse2) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse6) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) .cse6))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))))))) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= (select .cse9 0) 0))))) is different from false [2023-12-21 03:47:14,516 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse10 0)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse4) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse4)) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_old(#valid)_AFTER_CALL_27| .cse5)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) .cse2) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse6) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) .cse6))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))))))) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= (select .cse9 0) 0))))) is different from true [2023-12-21 03:47:14,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse1) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) .cse0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse1)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_old(#valid)_AFTER_CALL_27| .cse3)))))) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse4) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse5) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) .cse5))) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))))))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0)) (= (select .cse8 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) .cse0) .cse4))))) is different from false [2023-12-21 03:47:14,527 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse1) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) .cse0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse1)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_old(#valid)_AFTER_CALL_27| .cse3)))))) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse4) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (or (and (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse5) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) .cse5))) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))))))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0)) (= (select .cse8 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) .cse0) .cse4))))) is different from true [2023-12-21 03:47:14,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse13 0)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse7 .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse7 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse7)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_old(#valid)_AFTER_CALL_27| .cse8)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse7) 0))) (= .cse9 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse12 0) 0)))))) is different from false [2023-12-21 03:47:14,546 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse13 0)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse7 .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse7 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse7)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_old(#valid)_AFTER_CALL_27| .cse8)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse7) 0))) (= .cse9 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse3)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse12 0) 0)))))) is different from true [2023-12-21 03:47:14,555 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6)) (.cse4 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse6)) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse4)) (= (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse4) (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse9 (select |v_old(#valid)_AFTER_CALL_27| .cse9)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse12 0) 0)))))) is different from false [2023-12-21 03:47:14,557 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6)) (.cse4 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse6)) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse4)) (= (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse4) (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse9 (select |v_old(#valid)_AFTER_CALL_27| .cse9)))))) (or .cse0 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse12 0) 0)))))) is different from true [2023-12-21 03:47:14,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_old(#valid)_AFTER_CALL_27| .cse8)))))) (or .cse0 (= 0 .cse4)) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse9) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse10 (select |v_#valid_BEFORE_CALL_23| .cse10))))))) (= (select .cse11 0) 0) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse6))))))) is different from false [2023-12-21 03:47:14,570 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse0 (= .cse3 .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or .cse0 (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse3)) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_old(#valid)_AFTER_CALL_27| .cse8)))))) (or .cse0 (= 0 .cse4)) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse9) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse10 (select |v_#valid_BEFORE_CALL_23| .cse10))))))) (= (select .cse11 0) 0) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse6))))))) is different from true [2023-12-21 03:47:14,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse6)) (.cse3 (select .cse9 0)) (.cse1 (= .cse5 .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or .cse1 (and (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0))) (= (select .cse2 .cse4) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_#t~mem18#1.offset|) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse5)) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (or .cse1 (= 0 .cse4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse9 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse8 0) 0))))))) is different from false [2023-12-21 03:47:14,585 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse6)) (.cse3 (select .cse9 0)) (.cse1 (= .cse5 .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or .cse1 (and (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0))) (= (select .cse2 .cse4) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_#t~mem18#1.offset|) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse5)) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (or .cse1 (= 0 .cse4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse9 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse8 0) 0))))))) is different from true [2023-12-21 03:47:14,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse6)) (.cse3 (select .cse9 0)) (.cse1 (= .cse5 .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or .cse1 (and (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0))) (= (select .cse2 .cse4) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse5)) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (or .cse1 (= 0 .cse4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse9 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse8 0) 0))))))) is different from false [2023-12-21 03:47:14,599 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse6)) (.cse3 (select .cse9 0)) (.cse1 (= .cse5 .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or .cse1 (and (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0))) (= (select .cse2 .cse4) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_27| .cse5)) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (or .cse1 (= 0 .cse4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse9 .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_16 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse11 (select |v_#valid_BEFORE_CALL_23| .cse11))))))) (= (select .cse8 0) 0))))))) is different from true [2023-12-21 03:47:14,603 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_#t~mem18#1.offset|) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (exists ((v_arrayElimIndex_20 Int) (v_arrayElimIndex_19 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_19) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimIndex_20) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0))))))) is different from false [2023-12-21 03:47:14,604 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| |c_ULTIMATE.start_main_#t~mem18#1.offset|) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (exists ((v_arrayElimIndex_20 Int) (v_arrayElimIndex_19 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| v_arrayElimIndex_19) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimIndex_20) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0))))))) is different from true [2023-12-21 03:47:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:14,715 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-12-21 03:47:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:47:14,715 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 32 states have internal predecessors, (53), 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 35 [2023-12-21 03:47:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:14,716 INFO L225 Difference]: With dead ends: 63 [2023-12-21 03:47:14,716 INFO L226 Difference]: Without dead ends: 38 [2023-12-21 03:47:14,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=1168, Unknown=58, NotChecked=2784, Total=4160 [2023-12-21 03:47:14,717 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1201 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:14,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 1201 Unchecked, 0.2s Time] [2023-12-21 03:47:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-21 03:47:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-21 03:47:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:47:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-12-21 03:47:14,726 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 35 [2023-12-21 03:47:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:14,727 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-12-21 03:47:14,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 32 states have internal predecessors, (53), 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-21 03:47:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-12-21 03:47:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 03:47:14,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:14,727 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:14,734 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-21 03:47:14,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 03:47:14,934 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:14,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash -354010589, now seen corresponding path program 4 times [2023-12-21 03:47:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393274298] [2023-12-21 03:47:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:47:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 03:47:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-21 03:47:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393274298] [2023-12-21 03:47:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393274298] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354388174] [2023-12-21 03:47:15,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 03:47:15,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:15,021 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-21 03:47:15,044 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-21 03:47:15,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 03:47:15,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:15,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 187 conjunts are in the unsatisfiable core [2023-12-21 03:47:15,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:15,244 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-21 03:47:15,292 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-21 03:47:15,319 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-21 03:47:15,319 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 19 treesize of output 16 [2023-12-21 03:47:15,344 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-21 03:47:15,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-21 03:47:15,438 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:47:15,438 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 19 [2023-12-21 03:47:15,456 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:47:15,456 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-21 03:47:15,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 03:47:15,499 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:47:15,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-12-21 03:47:15,504 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-21 03:47:15,558 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 44 treesize of output 33 [2023-12-21 03:47:15,565 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-21 03:47:15,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-12-21 03:47:15,570 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 22 [2023-12-21 03:47:15,632 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 36 treesize of output 20 [2023-12-21 03:47:15,639 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:47:15,639 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 1 case distinctions, treesize of input 15 treesize of output 3 [2023-12-21 03:47:15,645 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-21 03:47:15,649 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-21 03:47:15,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:15,768 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 44 treesize of output 33 [2023-12-21 03:47:15,793 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-21 03:47:15,793 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 3 case distinctions, treesize of input 32 treesize of output 70 [2023-12-21 03:47:15,801 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 7 treesize of output 5 [2023-12-21 03:47:15,818 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 13 treesize of output 11 [2023-12-21 03:47:15,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:15,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:15,830 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 27 treesize of output 25 [2023-12-21 03:47:15,844 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-21 03:47:15,844 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 20 treesize of output 22 [2023-12-21 03:47:16,137 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 78 treesize of output 40 [2023-12-21 03:47:16,144 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 139 treesize of output 47 [2023-12-21 03:47:16,172 INFO L349 Elim1Store]: treesize reduction 119, result has 41.7 percent of original size [2023-12-21 03:47:16,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 136 [2023-12-21 03:47:16,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2023-12-21 03:47:16,661 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 178 treesize of output 118 [2023-12-21 03:47:16,668 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:47:16,668 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 97 treesize of output 48 [2023-12-21 03:47:16,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-21 03:47:16,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:47:16,820 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 62 treesize of output 82 [2023-12-21 03:47:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:47:16,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:17,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse6 (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| v_ArrVal_2268))) (let ((.cse14 (select .cse13 .cse7))) (let ((.cse12 (store .cse14 .cse8 0))) (store (store |c_#memory_$Pointer$#2.offset| .cse7 .cse12) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| (store (select (store .cse13 .cse7 .cse12) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46|) 0 (select .cse14 .cse8))))))) (.cse5 (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| v_ArrVal_2266))) (let ((.cse11 (select .cse10 .cse7))) (let ((.cse9 (store .cse11 .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse9) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| (store (select (store .cse10 .cse7 .cse9) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46|) 0 (select .cse11 .cse8))))))) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#2| .cse7 v_ArrVal_2257) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| v_ArrVal_2254)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse2 (select (select .cse6 .cse3) .cse4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46|) 0)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) (+ .cse2 4)))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse3) (+ .cse4 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 (select (select .cse5 .cse1) .cse2)) (+ 4 (select (select .cse6 .cse1) .cse2)))) (not (= (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_46| v_ArrVal_2267) .cse7) .cse8 (select v_ArrVal_2257 .cse8)) v_ArrVal_2257))))))) is different from false [2023-12-21 03:47:17,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354388174] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:17,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:47:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 31] total 34 [2023-12-21 03:47:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771063710] [2023-12-21 03:47:17,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:17,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 03:47:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 03:47:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1765, Unknown=5, NotChecked=84, Total=1980 [2023-12-21 03:47:17,674 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 34 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 26 states have internal predecessors, (49), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-21 03:47:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:17,961 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-12-21 03:47:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 03:47:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 26 states have internal predecessors, (49), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-12-21 03:47:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:17,961 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:47:17,961 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 03:47:17,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=152, Invalid=2199, Unknown=5, NotChecked=94, Total=2450 [2023-12-21 03:47:17,962 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:17,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:47:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 03:47:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 03:47:17,963 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-21 03:47:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 03:47:17,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2023-12-21 03:47:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:17,963 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 03:47:17,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 26 states have internal predecessors, (49), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-21 03:47:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 03:47:17,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 03:47:17,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:47:17,971 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-21 03:47:18,171 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,SelfDestructingSolverStorable14 [2023-12-21 03:47:18,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 03:47:21,308 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 628 649) no Hoare annotation was computed. [2023-12-21 03:47:21,309 INFO L895 garLoopResultBuilder]: At program point L610-2(lines 610 614) the Hoare annotation is: (let ((.cse14 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (.cse3 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0)) (.cse2 (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_25| (select (select |#memory_$Pointer$#2.base| .cse3) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse19 (select |v_old(#valid)_AFTER_CALL_27| .cse19))))))) (.cse4 (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (= (select (select |#memory_int#2| .cse3) 4) 1)) (.cse6 (not (= .cse14 0))) (.cse7 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) 0)) (.cse8 (= (select |#valid| (select (select |#memory_$Pointer$#2.base| .cse14) 0)) 1)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|)) (.cse15 (= (select (select |#memory_int#2| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4) 1)) (.cse17 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 0)) (.cse16 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 0) 0)) (.cse18 (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) (or (and .cse0 (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= (select (select |#memory_int#2| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 4) 1) .cse1 .cse2 (= (select (select |#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse3) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (select |#valid| .cse14) 1) .cse15 (<= |ULTIMATE.start_sll_circular_insert_~index#1| 0) .cse16 (= .cse3 .cse17) .cse18) (and .cse0 .cse1 .cse2 (= (select (select |#memory_int#2| .cse17) 4) 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) .cse4 .cse5 .cse6 .cse7 (= (select |#valid| .cse3) 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (select (select |#memory_$Pointer$#2.offset| .cse17) 0) 0) .cse15 (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| .cse14) (= .cse3 (select (select |#memory_$Pointer$#2.base| .cse17) 0)) .cse16 .cse18)))) [2023-12-21 03:47:21,309 INFO L899 garLoopResultBuilder]: For program point L610-3(lines 606 627) no Hoare annotation was computed. [2023-12-21 03:47:21,309 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 627) no Hoare annotation was computed. [2023-12-21 03:47:21,309 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 641) no Hoare annotation was computed. [2023-12-21 03:47:21,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 647) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L895 garLoopResultBuilder]: At program point L635-4(lines 635 641) the Hoare annotation is: (let ((.cse26 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select (select |#memory_$Pointer$#2.base| .cse26) 0))) (let ((.cse5 (select |#memory_$Pointer$#2.base| .cse10)) (.cse31 (select |#memory_int#2| .cse10))) (let ((.cse6 (select (select |#memory_$Pointer$#2.offset| .cse26) 0)) (.cse18 (select |#memory_int#2| |ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (= (select .cse31 4) 1)) (.cse23 (select |#memory_int#2| .cse26)) (.cse29 (select .cse5 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse2 (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (not (= (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (.cse3 (let ((.cse32 (= (select (select |#memory_$Pointer$#2.offset| .cse29) 0) 0))) (or (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int))) (= (select (store (store |#memory_int#2| .cse26 v_DerPreprocessor_1) .cse10 (store .cse23 0 (select .cse31 0))) .cse26) .cse23)) .cse32) (and (let ((.cse34 (store .cse31 0 (select (select |#memory_int#2| .cse29) 0)))) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse33 (select (store (store |#memory_int#2| .cse10 v_DerPreprocessor_1) .cse29 .cse34) .cse10))) (and (= (select .cse33 4) 1) (= .cse31 .cse33)))) (exists ((v_DerPreprocessor_1 (Array Int Int))) (= .cse31 (select (store (store |#memory_int#2| .cse10 v_DerPreprocessor_1) .cse29 .cse34) .cse10))))) .cse32)))) (.cse27 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~ptr~0#1.base|)) (.cse13 (= (select .cse18 4) 1)) (.cse4 (= .cse6 0)) (.cse7 (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_25| .cse29)) (= (select |v_#valid_BEFORE_CALL_25| .cse26) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse26) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse30 (select |v_old(#valid)_AFTER_CALL_27| .cse30))))))) (.cse8 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse28 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~ptr~0#1.base|)) (.cse22 (= .cse26 (select (select |#memory_$Pointer$#2.base| .cse29) 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select .cse5 .cse6) |ULTIMATE.start_main_~ptr~0#1.base|) .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$#2.offset| .cse10) .cse6) 0) .cse11 .cse12 (= 2 |ULTIMATE.start_main_~count~0#1|) (or (and .cse13 (let ((.cse16 (select .cse18 0))) (or (exists ((v_prenex_24 (Array Int Int)) (v_arrayElimIndex_12 Int)) (let ((.cse15 (select |#memory_int#2| v_arrayElimIndex_12))) (let ((.cse14 (select (store (store |#memory_int#2| v_arrayElimIndex_12 v_prenex_24) |ULTIMATE.start_main_~ptr~0#1.base| (store .cse15 0 .cse16)) v_arrayElimIndex_12))) (and (not (= |ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_12)) (= .cse14 .cse15) (= (select .cse14 4) 1))))) (exists ((v_prenex_25 (Array Int Int)) (v_arrayElimIndex_12 Int)) (and (not (= |ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_12)) (let ((.cse17 (select |#memory_int#2| v_arrayElimIndex_12))) (= .cse17 (select (store (store |#memory_int#2| v_arrayElimIndex_12 v_prenex_25) |ULTIMATE.start_main_~ptr~0#1.base| (store .cse17 0 .cse16)) v_arrayElimIndex_12)))))))) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_21| Int) (v_arrayElimIndex_12 Int) (v_prenex_26 (Array Int Int))) (let ((.cse21 (select |#memory_int#2| |v_ULTIMATE.start_main_#t~mem18#1.base_21|)) (.cse20 (select |#memory_int#2| v_arrayElimIndex_12))) (let ((.cse19 (store (store |#memory_int#2| |v_ULTIMATE.start_main_#t~mem18#1.base_21| v_prenex_26) v_arrayElimIndex_12 (store .cse21 0 (select .cse20 0))))) (and (= (select (select .cse19 |ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (not (= |ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimIndex_12)) (not (= |v_ULTIMATE.start_main_#t~mem18#1.base_21| v_arrayElimIndex_12)) (not (= |ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_#t~mem18#1.base_21|)) (= (select .cse20 4) 1) (= (select .cse19 |v_ULTIMATE.start_main_#t~mem18#1.base_21|) .cse21)))))) .cse22) (let ((.cse25 (select .cse28 0)) (.cse24 (select .cse27 0))) (and .cse0 .cse2 .cse3 .cse4 .cse7 (= (select .cse23 4) 1) .cse8 (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int#2| (select (select |#memory_$Pointer$#2.base| .cse24) .cse25)) 4) 1) (= (select (select |#memory_$Pointer$#2.offset| .cse24) .cse25) 0) .cse9 .cse11 .cse12 (= .cse26 |ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |#memory_int#2| .cse24) 4) 1) .cse22)) (and .cse0 .cse2 (= |ULTIMATE.start_main_~count~0#1| 1) .cse3 (= (select (select |#memory_int#2| (select .cse27 |ULTIMATE.start_main_~ptr~0#1.offset|)) 4) 1) .cse13 .cse4 .cse7 .cse8 .cse9 .cse11 .cse12 (= |ULTIMATE.start_main_~ptr~0#1.base| .cse10) (= (select .cse28 |ULTIMATE.start_main_~ptr~0#1.offset|) 0) .cse22))))))) [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L635-5(lines 628 649) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 624) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 624) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_int#2| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1)) (.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse4 .cse5 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) .cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |#valid| .cse7))) |#valid|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_int#2| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) 1) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) .cse3 .cse4 .cse5 .cse6))) [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L895 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$#2.base| .cse1) 0)) (.cse3 (select (select |#memory_$Pointer$#2.base| .cse2) 0))) (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |#memory_int#2| .cse0) 4) 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= (select (select |#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int#2| .cse1) 4) 1) (not (= .cse2 0)) (= (select (select |#memory_$Pointer$#2.offset| .cse3) 0) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |#valid| .cse4))) |#valid|) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (= (select |#valid| .cse2) 1) (= .cse1 (select (select |#memory_$Pointer$#2.base| .cse3) 0))))) [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L636(lines 636 638) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int#2| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~data#1| 1)) [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 628 649) no Hoare annotation was computed. [2023-12-21 03:47:21,310 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-12-21 03:47:21,311 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_create_~data#1| 1)) [2023-12-21 03:47:21,311 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-21 03:47:21,311 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-21 03:47:21,311 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-21 03:47:21,311 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) [2023-12-21 03:47:21,311 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-21 03:47:21,313 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:21,314 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:47:21,319 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-21 03:47:21,321 INFO L158 Benchmark]: Toolchain (without parser) took 78580.85ms. Allocated memory was 196.1MB in the beginning and 480.2MB in the end (delta: 284.2MB). Free memory was 161.2MB in the beginning and 412.0MB in the end (delta: -250.8MB). Peak memory consumption was 286.9MB. Max. memory is 8.0GB. [2023-12-21 03:47:21,321 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 196.1MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:47:21,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.74ms. Allocated memory is still 196.1MB. Free memory was 160.8MB in the beginning and 142.5MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:47:21,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.50ms. Allocated memory is still 196.1MB. Free memory was 142.5MB in the beginning and 140.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:47:21,324 INFO L158 Benchmark]: Boogie Preprocessor took 36.05ms. Allocated memory is still 196.1MB. Free memory was 140.2MB in the beginning and 136.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 03:47:21,324 INFO L158 Benchmark]: RCFGBuilder took 320.08ms. Allocated memory is still 196.1MB. Free memory was 136.7MB in the beginning and 117.2MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 03:47:21,325 INFO L158 Benchmark]: TraceAbstraction took 77887.70ms. Allocated memory was 196.1MB in the beginning and 480.2MB in the end (delta: 284.2MB). Free memory was 116.4MB in the beginning and 412.0MB in the end (delta: -295.6MB). Peak memory consumption was 241.9MB. Max. memory is 8.0GB. [2023-12-21 03:47:21,325 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.39ms. Allocated memory is still 196.1MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.74ms. Allocated memory is still 196.1MB. Free memory was 160.8MB in the beginning and 142.5MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.50ms. Allocated memory is still 196.1MB. Free memory was 142.5MB in the beginning and 140.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.05ms. Allocated memory is still 196.1MB. Free memory was 140.2MB in the beginning and 136.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 320.08ms. Allocated memory is still 196.1MB. Free memory was 136.7MB in the beginning and 117.2MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 77887.70ms. Allocated memory was 196.1MB in the beginning and 480.2MB in the end (delta: 284.2MB). Free memory was 116.4MB in the beginning and 412.0MB in the end (delta: -295.6MB). Peak memory consumption was 241.9MB. 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: 647]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 403 mSDsluCounter, 2414 SdHoareTripleChecker+Invalid, 22.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1295 IncrementalHoareTripleChecker+Unchecked, 2133 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4398 IncrementalHoareTripleChecker+Invalid, 5807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 281 mSDtfsCounter, 4398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 356 SyntacticMatches, 3 SemanticMatches, 476 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 4367 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=13, InterpolantAutomatonStates: 222, 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, 15 MinimizatonAttempts, 100 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 24 NumberOfFragments, 2442 HoareAnnotationTreeSize, 14 FormulaSimplifications, 9523 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FormulaSimplificationsInter, 4790 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 38.7s InterpolantComputationTime, 735 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 797 ConstructedInterpolants, 80 QuantifiedInterpolants, 20722 SizeOfPredicates, 196 NumberOfNonLiveVariables, 3551 ConjunctsInSsa, 950 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 242/413 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 - 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-21 03:47:21,371 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...