/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:23:21,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:23:21,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:23:21,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:23:21,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:23:21,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:23:21,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:23:21,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:23:21,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:23:21,158 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:23:21,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:23:21,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:23:21,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:23:21,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:23:21,160 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:23:21,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:23:21,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:23:21,161 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:23:21,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:23:21,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:23:21,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:23:21,163 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:23:21,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:23:21,164 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:23:21,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:23:21,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:23:21,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:21,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:23:21,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:23:21,166 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:23:21,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:23:21,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:23:21,166 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:23:21,166 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 [2023-12-24 21:23:21,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:23:21,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:23:21,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:23:21,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:23:21,409 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:23:21,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2023-12-24 21:23:22,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:23:22,799 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:23:22,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2023-12-24 21:23:22,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bc748eb/a7192f3267da48b795b9f99215db4d39/FLAGc87f9043a [2023-12-24 21:23:22,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bc748eb/a7192f3267da48b795b9f99215db4d39 [2023-12-24 21:23:22,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:23:22,830 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:23:22,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:23:22,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:23:22,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:23:22,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:23:22" (1/1) ... [2023-12-24 21:23:22,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4011b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:22, skipping insertion in model container [2023-12-24 21:23:22,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:23:22" (1/1) ... [2023-12-24 21:23:22,877 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:23:23,117 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/dll2c_insert_equal.i[24877,24890] [2023-12-24 21:23:23,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:23:23,128 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:23:23,168 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/dll2c_insert_equal.i[24877,24890] [2023-12-24 21:23:23,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:23:23,190 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:23:23,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23 WrapperNode [2023-12-24 21:23:23,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:23:23,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:23:23,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:23:23,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:23:23,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,233 INFO L138 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 157 [2023-12-24 21:23:23,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:23:23,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:23:23,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:23:23,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:23:23,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,271 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2023-12-24 21:23:23,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:23:23,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:23:23,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:23:23,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:23:23,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (1/1) ... [2023-12-24 21:23:23,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:23:23,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:23:23,329 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-24 21:23:23,348 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-24 21:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:23:23,353 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:23:23,354 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:23:23,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:23:23,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:23:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:23:23,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:23:23,487 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:23:23,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:23:24,071 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:23:24,094 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:23:24,094 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 21:23:24,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:23:24 BoogieIcfgContainer [2023-12-24 21:23:24,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:23:24,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:23:24,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:23:24,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:23:24,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:23:22" (1/3) ... [2023-12-24 21:23:24,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e1b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:23:24, skipping insertion in model container [2023-12-24 21:23:24,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:23" (2/3) ... [2023-12-24 21:23:24,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e1b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:23:24, skipping insertion in model container [2023-12-24 21:23:24,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:23:24" (3/3) ... [2023-12-24 21:23:24,100 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-12-24 21:23:24,112 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:23:24,112 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:23:24,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:23:24,146 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;@25e9733f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:23:24,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:23:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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-24 21:23:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:23:24,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:24,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:24,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:24,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -680816188, now seen corresponding path program 1 times [2023-12-24 21:23:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32011280] [2023-12-24 21:23:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:24,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:24,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:24,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:23:24,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:23:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:24,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:23:24,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:24,470 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-24 21:23:24,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:23:24,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32011280] [2023-12-24 21:23:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32011280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:23:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:23:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:23:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133653888] [2023-12-24 21:23:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:23:24,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:23:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:23:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:23:24,505 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:23:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:24,598 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2023-12-24 21:23:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:23:24,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-24 21:23:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:24,604 INFO L225 Difference]: With dead ends: 56 [2023-12-24 21:23:24,604 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 21:23:24,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:23:24,611 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:24,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:23:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 21:23:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-24 21:23:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:23:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-12-24 21:23:24,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 19 [2023-12-24 21:23:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:24,642 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-12-24 21:23:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:23:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-12-24 21:23:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:23:24,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:24,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:24,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 21:23:24,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:24,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:24,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558312, now seen corresponding path program 1 times [2023-12-24 21:23:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:24,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793538532] [2023-12-24 21:23:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:24,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:24,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:24,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:23:24,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:23:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:24,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:23:25,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:23:25,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:23:25,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793538532] [2023-12-24 21:23:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793538532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:23:25,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:23:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:23:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055357624] [2023-12-24 21:23:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:23:25,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:23:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:23:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:23:25,029 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:23:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:25,130 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2023-12-24 21:23:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:23:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-12-24 21:23:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:25,132 INFO L225 Difference]: With dead ends: 47 [2023-12-24 21:23:25,132 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 21:23:25,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-24 21:23:25,133 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:25,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:23:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 21:23:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-12-24 21:23:25,137 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-24 21:23:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-12-24 21:23:25,138 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-12-24 21:23:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:25,138 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-12-24 21:23:25,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:23:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-12-24 21:23:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 21:23:25,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:25,142 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-24 21:23:25,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 21:23:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:25,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:25,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash 119173117, now seen corresponding path program 1 times [2023-12-24 21:23:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:25,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685788402] [2023-12-24 21:23:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:25,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:25,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:23:25,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:23:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:25,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:23:25,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:25,544 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-24 21:23:25,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:23:25,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685788402] [2023-12-24 21:23:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685788402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:23:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:23:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:23:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797460127] [2023-12-24 21:23:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:23:25,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:23:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:23:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:23:25,550 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.25) 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-24 21:23:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:25,664 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-12-24 21:23:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:23:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) 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-24 21:23:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:25,666 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:23:25,666 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:23:25,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:23:25,667 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:25,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:23:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:23:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-24 21:23:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-24 21:23:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-12-24 21:23:25,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 27 [2023-12-24 21:23:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:25,671 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-12-24 21:23:25,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) 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-24 21:23:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-12-24 21:23:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 21:23:25,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:25,672 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-24 21:23:25,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:23:25,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:25,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:25,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash 935091600, now seen corresponding path program 1 times [2023-12-24 21:23:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152814103] [2023-12-24 21:23:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:25,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:25,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:25,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:23:25,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:23:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:26,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-24 21:23:26,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:26,188 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 7 [2023-12-24 21:23:26,353 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-24 21:23:26,420 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:26,420 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 27 [2023-12-24 21:23:26,505 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-24 21:23:26,514 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-24 21:23:26,581 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-24 21:23:26,592 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-24 21:23:26,765 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2023-12-24 21:23:26,766 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 2 case distinctions, treesize of input 164 treesize of output 74 [2023-12-24 21:23:26,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:26,780 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 50 treesize of output 39 [2023-12-24 21:23:26,788 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-24 21:23:26,901 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:23:26,902 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 51 treesize of output 26 [2023-12-24 21:23:26,912 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 19 treesize of output 11 [2023-12-24 21:23:26,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:23:27,125 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:23:27,125 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 20 treesize of output 23 [2023-12-24 21:23:27,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:27,162 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:23:27,162 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 59 treesize of output 48 [2023-12-24 21:23:27,192 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:27,193 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-24 21:23:27,502 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:23:27,502 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 59 treesize of output 26 [2023-12-24 21:23:27,687 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 64 treesize of output 26 [2023-12-24 21:23:27,691 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-24 21:23:27,754 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-24 21:23:27,839 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-24 21:23:27,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:28,205 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_349 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_349) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_350) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_348) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-24 21:23:28,594 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_349 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_358) .cse0) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_349) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_350) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_357) .cse0) .cse1) v_ArrVal_348) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12|)))))) is different from false [2023-12-24 21:23:28,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152814103] [2023-12-24 21:23:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152814103] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [397197026] [2023-12-24 21:23:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:28,599 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:23:28,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:23:28,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-24 21:23:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:29,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-24 21:23:29,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:29,172 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 7 [2023-12-24 21:23:29,344 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-24 21:23:29,407 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:29,407 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 27 [2023-12-24 21:23:29,538 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-24 21:23:29,554 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-24 21:23:29,660 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-24 21:23:29,667 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-24 21:23:29,954 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2023-12-24 21:23:29,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 126 [2023-12-24 21:23:29,964 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-12-24 21:23:29,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 92 [2023-12-24 21:23:29,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:29,972 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-24 21:23:29,977 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-24 21:23:29,983 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 40 treesize of output 27 [2023-12-24 21:23:30,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-24 21:23:30,081 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-24 21:23:30,085 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 19 treesize of output 11 [2023-12-24 21:23:34,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:34,341 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 40 treesize of output 29 [2023-12-24 21:23:34,364 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:34,364 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-24 21:23:34,391 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-24 21:23:34,737 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 40 treesize of output 16 [2023-12-24 21:23:34,930 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-12-24 21:23:34,939 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 25 treesize of output 15 [2023-12-24 21:23:35,048 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-24 21:23:35,058 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-24 21:23:35,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:35,947 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_475 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_483) .cse0) .cse1 v_ArrVal_475)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_473) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_484) .cse0) .cse1) v_ArrVal_474)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-24 21:23:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [397197026] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:35,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:23:35,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2023-12-24 21:23:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202120624] [2023-12-24 21:23:35,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:23:35,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-24 21:23:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:35,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-24 21:23:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1960, Unknown=56, NotChecked=276, Total=2450 [2023-12-24 21:23:35,955 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 29 states have internal predecessors, (37), 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-24 21:23:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:49,339 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-12-24 21:23:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 21:23:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 29 states have internal predecessors, (37), 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 28 [2023-12-24 21:23:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:49,342 INFO L225 Difference]: With dead ends: 59 [2023-12-24 21:23:49,342 INFO L226 Difference]: Without dead ends: 57 [2023-12-24 21:23:49,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=273, Invalid=3223, Unknown=56, NotChecked=354, Total=3906 [2023-12-24 21:23:49,344 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:49,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 230 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-12-24 21:23:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-24 21:23:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2023-12-24 21:23:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:23:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2023-12-24 21:23:49,356 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 28 [2023-12-24 21:23:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:49,356 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2023-12-24 21:23:49,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 29 states have internal predecessors, (37), 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-24 21:23:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2023-12-24 21:23:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:23:49,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:49,358 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-24 21:23:49,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:23:49,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:23:49,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:49,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:49,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash 458760797, now seen corresponding path program 2 times [2023-12-24 21:23:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860755599] [2023-12-24 21:23:49,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:23:49,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:49,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:49,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:23:49,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:23:49,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:23:49,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:23:49,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:23:49,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 21:23:49,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 21:23:50,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860755599] [2023-12-24 21:23:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860755599] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:23:50,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:23:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:23:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299668622] [2023-12-24 21:23:50,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:23:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:23:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:23:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:23:50,482 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-24 21:23:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:50,734 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2023-12-24 21:23:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:23:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-12-24 21:23:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:50,736 INFO L225 Difference]: With dead ends: 55 [2023-12-24 21:23:50,736 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 21:23:50,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:23:50,736 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:50,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 95 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:23:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 21:23:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-24 21:23:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:23:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-12-24 21:23:50,744 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 29 [2023-12-24 21:23:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:50,744 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-12-24 21:23:50,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-24 21:23:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2023-12-24 21:23:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:23:50,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:50,745 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, 1, 1] [2023-12-24 21:23:50,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 21:23:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:50,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:50,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 976741128, now seen corresponding path program 1 times [2023-12-24 21:23:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528493411] [2023-12-24 21:23:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:50,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:23:50,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:50,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:23:50,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:23:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:51,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-24 21:23:51,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:51,287 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 7 [2023-12-24 21:23:51,392 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:51,392 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 27 [2023-12-24 21:23:51,438 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-24 21:23:51,478 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-24 21:23:51,582 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2023-12-24 21:23:51,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 89 [2023-12-24 21:23:51,589 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 20 treesize of output 19 [2023-12-24 21:23:51,751 INFO L349 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2023-12-24 21:23:51,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 358 treesize of output 352 [2023-12-24 21:23:51,783 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-24 21:23:51,784 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 319 treesize of output 311 [2023-12-24 21:23:51,820 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-24 21:23:51,821 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 311 [2023-12-24 21:23:51,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:51,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:23:51,866 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 48 treesize of output 64 [2023-12-24 21:23:52,028 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 18 treesize of output 14 [2023-12-24 21:23:52,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:52,225 INFO L349 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-12-24 21:23:52,225 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 435 treesize of output 424 [2023-12-24 21:23:52,269 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-24 21:23:52,270 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 296 [2023-12-24 21:23:52,313 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-24 21:23:52,313 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 297 treesize of output 295 [2023-12-24 21:23:52,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:52,425 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-12-24 21:23:52,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 93 [2023-12-24 21:23:52,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:23:52,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-12-24 21:23:52,980 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 110 treesize of output 52 [2023-12-24 21:23:53,047 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:23:53,050 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 73 [2023-12-24 21:23:53,195 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:23:53,196 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-24 21:23:53,309 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 100 treesize of output 60 [2023-12-24 21:23:53,315 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-12-24 21:23:53,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 22 [2023-12-24 21:23:53,351 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-24 21:23:53,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:54,377 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_694 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24| (_ BitVec 32))) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24| v_ArrVal_694)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse3 .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse5 .cse6))) (store (let ((.cse2 (store .cse5 .cse6 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24|))) (store (store |c_#memory_$Pointer$#1.base| .cse1 .cse2) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24| (store (store (select (store .cse3 .cse1 .cse2) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse4))) .cse4 v_ArrVal_686)))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24|))))) is different from false [2023-12-24 21:23:54,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:54,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528493411] [2023-12-24 21:23:54,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528493411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:54,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1571998987] [2023-12-24 21:23:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:23:54,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:23:54,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-24 21:23:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:54,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 21:23:54,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:54,857 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 7 [2023-12-24 21:23:55,030 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:55,031 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 27 [2023-12-24 21:23:55,132 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-24 21:23:55,233 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-24 21:23:55,450 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2023-12-24 21:23:55,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 89 [2023-12-24 21:23:55,457 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 20 treesize of output 19 [2023-12-24 21:23:55,466 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-12-24 21:23:55,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 54 [2023-12-24 21:23:55,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-24 21:23:55,474 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 40 treesize of output 27 [2023-12-24 21:23:55,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-24 21:23:55,581 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 19 treesize of output 11 [2023-12-24 21:23:59,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:59,877 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 40 treesize of output 29 [2023-12-24 21:23:59,899 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:59,899 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-24 21:24:00,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 37 [2023-12-24 21:24:00,393 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:24:00,393 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 2 case distinctions, treesize of input 58 treesize of output 31 [2023-12-24 21:24:00,507 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:24:00,507 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-24 21:24:00,604 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-24 21:24:00,606 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-24 21:24:00,608 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-24 21:24:00,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:24:05,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28|) (_ bv0 1))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28| v_ArrVal_806) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 .cse3 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28| v_ArrVal_803) (select .cse2 .cse3) v_ArrVal_800))) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-12-24 21:24:05,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1571998987] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:24:05,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:24:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 39 [2023-12-24 21:24:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328849562] [2023-12-24 21:24:05,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:24:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-24 21:24:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:24:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-24 21:24:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1966, Unknown=44, NotChecked=182, Total=2352 [2023-12-24 21:24:05,403 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 30 states have internal predecessors, (41), 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-24 21:24:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:24:20,484 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2023-12-24 21:24:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 21:24:20,486 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.28125) internal successors, (41), 30 states have internal predecessors, (41), 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 30 [2023-12-24 21:24:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:24:20,487 INFO L225 Difference]: With dead ends: 58 [2023-12-24 21:24:20,487 INFO L226 Difference]: Without dead ends: 55 [2023-12-24 21:24:20,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=242, Invalid=2907, Unknown=51, NotChecked=222, Total=3422 [2023-12-24 21:24:20,488 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:24:20,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 363 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 790 Invalid, 6 Unknown, 0 Unchecked, 14.0s Time] [2023-12-24 21:24:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-24 21:24:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2023-12-24 21:24:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:24:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-12-24 21:24:20,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 30 [2023-12-24 21:24:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:24:20,496 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-12-24 21:24:20,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.28125) internal successors, (41), 30 states have internal predecessors, (41), 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-24 21:24:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-12-24 21:24:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:24:20,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:24:20,496 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, 1, 1] [2023-12-24 21:24:20,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-24 21:24:20,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:24:20,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:24:20,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:24:20,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:24:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1722660074, now seen corresponding path program 1 times [2023-12-24 21:24:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:24:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690186076] [2023-12-24 21:24:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:24:20,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:24:20,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:24:20,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:24:20,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 21:24:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:24:21,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 21:24:21,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:24:21,165 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-24 21:24:21,186 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-24 21:24:21,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:24:21,250 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-24 21:24:21,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:24:21,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690186076] [2023-12-24 21:24:21,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690186076] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:24:21,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:24:21,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2023-12-24 21:24:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912485255] [2023-12-24 21:24:21,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:24:21,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 21:24:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:24:21,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 21:24:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:24:21,251 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:24:25,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:24:29,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:24:33,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:24:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:24:35,423 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-12-24 21:24:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 21:24:35,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-12-24 21:24:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:24:35,424 INFO L225 Difference]: With dead ends: 69 [2023-12-24 21:24:35,424 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 21:24:35,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-12-24 21:24:35,424 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:24:35,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2023-12-24 21:24:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 21:24:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-24 21:24:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-24 21:24:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-24 21:24:35,431 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 30 [2023-12-24 21:24:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:24:35,431 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-24 21:24:35,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:24:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-24 21:24:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:24:35,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:24:35,432 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, 1, 1] [2023-12-24 21:24:35,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-24 21:24:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:24:35,638 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:24:35,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:24:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 214245073, now seen corresponding path program 1 times [2023-12-24 21:24:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:24:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762674447] [2023-12-24 21:24:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:24:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:24:35,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:24:35,640 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:24:35,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 21:24:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:24:35,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-24 21:24:35,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:24:35,972 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 7 [2023-12-24 21:24:36,089 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:24:36,089 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 27 [2023-12-24 21:24:36,127 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-24 21:24:36,190 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-24 21:24:36,320 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2023-12-24 21:24:36,320 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 2 case distinctions, treesize of input 115 treesize of output 41 [2023-12-24 21:24:36,400 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:24:36,400 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 51 treesize of output 26 [2023-12-24 21:24:36,404 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 19 treesize of output 11 [2023-12-24 21:24:36,483 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-24 21:24:36,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:36,582 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:24:36,582 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 59 treesize of output 48 [2023-12-24 21:24:36,610 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:24:36,611 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-24 21:24:37,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-12-24 21:24:37,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:37,113 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 60 treesize of output 14 [2023-12-24 21:24:37,138 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-12-24 21:24:37,139 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 67 [2023-12-24 21:24:37,165 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:24:37,166 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 126 treesize of output 73 [2023-12-24 21:24:37,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-24 21:24:37,178 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 41 treesize of output 15 [2023-12-24 21:24:37,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 19 [2023-12-24 21:24:37,277 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 50 treesize of output 30 [2023-12-24 21:24:37,361 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 27 treesize of output 15 [2023-12-24 21:24:37,365 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-24 21:24:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:24:37,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:24:37,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:24:37,677 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 70 treesize of output 71 [2023-12-24 21:24:37,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:24:37,723 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 268 treesize of output 271 [2023-12-24 21:24:37,733 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 248 treesize of output 236 [2023-12-24 21:24:37,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 114 [2023-12-24 21:24:44,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse9 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (not .cse9)) (.cse14 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse22 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse22 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse24 (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse13 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))) (.cse7 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse6 (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse9) (or (and (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) .cse9) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse11 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse13)) (or (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) .cse14) (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse7)) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) .cse7)) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) .cse9)) .cse13) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) .cse14) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse20 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))))) is different from false [2023-12-24 21:24:48,137 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse9 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (not .cse9)) (.cse14 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse22 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse22 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse24 (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse13 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))) (.cse7 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse6 (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse9) (or (and (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) .cse9) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse11 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse13)) (or (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) .cse14) (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse7)) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) .cse7)) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) .cse9)) .cse13) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) .cse14) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse20 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))))) is different from true [2023-12-24 21:24:54,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= .cse6 .cse4))) (let ((.cse13 (and (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) .cse8) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse11))) (.cse17 (not .cse11)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse8 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))) (or .cse13 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or .cse13 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse8)) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse21 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))))) is different from false [2023-12-24 21:24:58,470 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= .cse6 .cse4))) (let ((.cse13 (and (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) .cse8) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse11))) (.cse17 (not .cse11)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse8 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))) (or .cse13 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or .cse13 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse8)) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse21 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))))) is different from true [2023-12-24 21:25:03,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse17 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse32 .cse17)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse32 .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse11 (= .cse7 .cse5))) (let ((.cse14 (not .cse11)) (.cse4 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv8 32))) (.cse18 (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd v_arrayElimCell_139 (_ bv8 32))))))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32))))))) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))) (or .cse0 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse30 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))))))))) (and (or .cse0 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse3 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))) .cse11))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= (select .cse13 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (bvadd v_arrayElimCell_139 (_ bv8 32)))))))) .cse14) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse16 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse16 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (bvadd v_arrayElimCell_139 (_ bv8 32)))))))))) (or (= .cse8 .cse17) .cse18) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_139 (_ bv8 32)))))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse20 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (bvadd v_arrayElimCell_139 (_ bv8 32))))))) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)))))) (not .cse0)) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= (select (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse14) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse23 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 (bvadd v_arrayElimCell_139 (_ bv8 32))))))))) (or (= .cse7 .cse9) .cse18))))))) is different from false Received shutdown request... [2023-12-24 21:38:05,756 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:38:05,787 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:38:06,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:06,987 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 21:38:07,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:07,012 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:38:07,012 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [762674447]. [2023-12-24 21:38:07,015 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:07,016 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 137 [2023-12-24 21:38:07,019 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:38:07,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:38:07 BoogieIcfgContainer [2023-12-24 21:38:07,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:38:07,022 INFO L158 Benchmark]: Toolchain (without parser) took 884191.87ms. Allocated memory was 250.6MB in the beginning and 308.3MB in the end (delta: 57.7MB). Free memory was 206.0MB in the beginning and 198.5MB in the end (delta: 7.4MB). Peak memory consumption was 176.3MB. Max. memory is 8.0GB. [2023-12-24 21:38:07,022 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory was 124.6MB in the beginning and 124.5MB in the end (delta: 125.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:38:07,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.51ms. Allocated memory is still 250.6MB. Free memory was 205.5MB in the beginning and 186.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 21:38:07,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.26ms. Allocated memory is still 250.6MB. Free memory was 186.1MB in the beginning and 183.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:38:07,023 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 250.6MB. Free memory was 183.5MB in the beginning and 179.8MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:38:07,023 INFO L158 Benchmark]: RCFGBuilder took 804.63ms. Allocated memory is still 250.6MB. Free memory was 179.3MB in the beginning and 155.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-24 21:38:07,023 INFO L158 Benchmark]: TraceAbstraction took 882925.59ms. Allocated memory was 250.6MB in the beginning and 308.3MB in the end (delta: 57.7MB). Free memory was 154.2MB in the beginning and 198.5MB in the end (delta: -44.4MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2023-12-24 21:38:07,025 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.17ms. Allocated memory is still 172.0MB. Free memory was 124.6MB in the beginning and 124.5MB in the end (delta: 125.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.51ms. Allocated memory is still 250.6MB. Free memory was 205.5MB in the beginning and 186.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.26ms. Allocated memory is still 250.6MB. Free memory was 186.1MB in the beginning and 183.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 250.6MB. Free memory was 183.5MB in the beginning and 179.8MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 804.63ms. Allocated memory is still 250.6MB. Free memory was 179.3MB in the beginning and 155.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 882925.59ms. Allocated memory was 250.6MB in the beginning and 308.3MB in the end (delta: 57.7MB). Free memory was 154.2MB in the beginning and 198.5MB in the end (delta: -44.4MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 658). Cancelled while NwaCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [762674447]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 882.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 40.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 39.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 849 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1623 IncrementalHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 170 mSDtfsCounter, 1623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=7, InterpolantAutomatonStates: 74, 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, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 288 ConstructedInterpolants, 39 QuantifiedInterpolants, 3802 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2244 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 76/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown