/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_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:23:13,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:23:13,822 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:13,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:23:13,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:23:13,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:23:13,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:23:13,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:23:13,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:23:13,858 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:23:13,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:23:13,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:23:13,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:23:13,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:23:13,860 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:23:13,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:23:13,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:23:13,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:23:13,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:23:13,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:23:13,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:23:13,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:23:13,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:23:13,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:23:13,862 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:23:13,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:23:13,863 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:23:13,863 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:23:13,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:23:13,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:23:13,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:23:13,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:23:13,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:23:13,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:23:13,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:23:13,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:23:13,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:23:13,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:23:13,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:23:13,866 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:23:13,866 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:14,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:23:14,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:23:14,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:23:14,079 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:23:14,079 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:23:14,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_equal.i [2023-12-24 21:23:15,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:23:15,261 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:23:15,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_equal.i [2023-12-24 21:23:15,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65fe0c68/fe0c3543065d4dc9a693d17e5a1bad1e/FLAGcdcb28c4b [2023-12-24 21:23:15,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65fe0c68/fe0c3543065d4dc9a693d17e5a1bad1e [2023-12-24 21:23:15,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:23:15,289 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:23:15,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:23:15,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:23:15,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:23:15,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:23:15" (1/1) ... [2023-12-24 21:23:15,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621553d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:15, skipping insertion in model container [2023-12-24 21:23:15,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:23:15" (1/1) ... [2023-12-24 21:23:15,332 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:23:15,594 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_append_equal.i[24585,24598] [2023-12-24 21:23:15,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:23:15,609 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:23:15,659 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_append_equal.i[24585,24598] [2023-12-24 21:23:15,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:23:15,681 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:23:15,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:15 WrapperNode [2023-12-24 21:23:15,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:23:15,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:23:15,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:23:15,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:23:15,687 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:15" (1/1) ... [2023-12-24 21:23:15,700 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:15" (1/1) ... [2023-12-24 21:23:15,718 INFO L138 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2023-12-24 21:23:15,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:23:15,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:23:15,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:23:15,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:23:15,734 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:15" (1/1) ... [2023-12-24 21:23:15,734 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:15" (1/1) ... [2023-12-24 21:23:15,747 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:15" (1/1) ... [2023-12-24 21:23:15,769 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2023-12-24 21:23:15,769 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:15" (1/1) ... [2023-12-24 21:23:15,769 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:15" (1/1) ... [2023-12-24 21:23:15,776 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:15" (1/1) ... [2023-12-24 21:23:15,780 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:15" (1/1) ... [2023-12-24 21:23:15,781 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:15" (1/1) ... [2023-12-24 21:23:15,783 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:15" (1/1) ... [2023-12-24 21:23:15,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:23:15,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:23:15,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:23:15,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:23:15,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:15" (1/1) ... [2023-12-24 21:23:15,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:23:15,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:23:15,822 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:15,833 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:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:23:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:23:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:23:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:23:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:23:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:23:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:23:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:23:15,961 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:23:15,962 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:23:16,263 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:23:16,289 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:23:16,289 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:23:16,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:23:16 BoogieIcfgContainer [2023-12-24 21:23:16,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:23:16,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:23:16,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:23:16,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:23:16,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:23:15" (1/3) ... [2023-12-24 21:23:16,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5a2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:23:16, skipping insertion in model container [2023-12-24 21:23:16,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:23:15" (2/3) ... [2023-12-24 21:23:16,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5a2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:23:16, skipping insertion in model container [2023-12-24 21:23:16,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:23:16" (3/3) ... [2023-12-24 21:23:16,296 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-12-24 21:23:16,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:23:16,308 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:23:16,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:23:16,339 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;@3a33f38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:23:16,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:23:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 21:23:16,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:16,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:16,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:16,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -540897351, now seen corresponding path program 1 times [2023-12-24 21:23:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799632160] [2023-12-24 21:23:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:16,359 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:16,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:16,360 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:16,364 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:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:16,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:23:16,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:16,558 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:16,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:23:16,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799632160] [2023-12-24 21:23:16,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799632160] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:23:16,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:23:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:23:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328319554] [2023-12-24 21:23:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:23:16,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:23:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:23:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:23:16,590 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 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:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:16,652 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2023-12-24 21:23:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:23:16,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2023-12-24 21:23:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:16,658 INFO L225 Difference]: With dead ends: 50 [2023-12-24 21:23:16,658 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 21:23:16,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:16,662 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:16,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:23:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 21:23:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-24 21:23:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-24 21:23:16,685 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2023-12-24 21:23:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:16,686 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-24 21:23:16,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-24 21:23:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 21:23:16,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:16,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:16,693 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:16,890 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:16,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:16,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2075980679, now seen corresponding path program 1 times [2023-12-24 21:23:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719296762] [2023-12-24 21:23:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:16,893 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:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:16,895 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:16,901 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:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:17,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:23:17,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:17,050 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:17,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:23:17,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719296762] [2023-12-24 21:23:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719296762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:23:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:23:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:23:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676169390] [2023-12-24 21:23:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:23:17,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:23:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:23:17,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:23:17,053 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:17,151 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-12-24 21:23:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:23:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2023-12-24 21:23:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:17,153 INFO L225 Difference]: With dead ends: 41 [2023-12-24 21:23:17,153 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:23:17,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:17,155 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 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:17,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 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:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:23:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-24 21:23:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-24 21:23:17,159 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-24 21:23:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:17,160 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-24 21:23:17,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-24 21:23:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:23:17,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:17,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:17,167 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 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:23:17,361 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:17,362 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:17,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 12333954, now seen corresponding path program 1 times [2023-12-24 21:23:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134502696] [2023-12-24 21:23:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:17,363 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:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:17,364 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:17,365 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:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:17,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 21:23:17,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:17,662 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:23:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:23:17,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:23:17,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134502696] [2023-12-24 21:23:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134502696] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:23:17,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:23:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-12-24 21:23:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085443562] [2023-12-24 21:23:17,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:23:17,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:23:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:23:17,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:23:17,748 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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:23:21,761 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:23:25,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 21:23:29,927 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:23:34,990 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:23:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:35,020 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-12-24 21:23:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:23:35,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 26 [2023-12-24 21:23:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:35,021 INFO L225 Difference]: With dead ends: 49 [2023-12-24 21:23:35,021 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 21:23:35,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-24 21:23:35,022 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:35,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2023-12-24 21:23:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 21:23:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-12-24 21:23:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 21:23:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-24 21:23:35,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 26 [2023-12-24 21:23:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:35,027 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-24 21:23:35,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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:23:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-24 21:23:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:23:35,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:35,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:23:35,035 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:35,232 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:35,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:35,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 14180996, now seen corresponding path program 1 times [2023-12-24 21:23:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423189664] [2023-12-24 21:23:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:35,233 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:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:35,234 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:35,240 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:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:35,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-24 21:23:35,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:35,489 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:35,623 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:35,708 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:35,709 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:35,780 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:35,837 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:35,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:35,957 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:35,962 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:35,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:35,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-24 21:23:35,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-12-24 21:23:36,064 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:36,070 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:36,075 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:36,237 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:23:36,238 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:36,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:36,260 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:36,287 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:36,288 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:36,507 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 84 treesize of output 52 [2023-12-24 21:23:36,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:36,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:36,516 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 45 treesize of output 36 [2023-12-24 21:23:36,521 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:36,587 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:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:23:36,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:36,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_327 (_ BitVec 32)) (v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_326) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_328))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_327)))) (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:37,028 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_327 (_ BitVec 32)) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_336) .cse1) .cse2) v_ArrVal_326) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_328))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_327)))) (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_append_#t~ret9#1.base_16|))))) is different from false [2023-12-24 21:23:37,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423189664] [2023-12-24 21:23:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423189664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [578277456] [2023-12-24 21:23:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:37,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:23:37,078 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:37,083 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:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:37,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-24 21:23:37,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:37,488 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:37,633 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:37,670 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:37,670 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:37,765 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:37,857 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:38,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:38,078 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:38,082 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:38,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:38,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-24 21:23:38,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-12-24 21:23:38,192 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:38,197 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:38,201 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:42,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:42,432 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:42,453 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:42,453 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:42,470 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:42,744 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 84 treesize of output 52 [2023-12-24 21:23:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:42,751 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 45 treesize of output 36 [2023-12-24 21:23:42,755 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:42,829 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:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:23:42,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:43,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| (_ BitVec 32)) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_460) .cse1) .cse2) v_ArrVal_450) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_452))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20|))) (not (= v_ArrVal_449 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_449 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_449) (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:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [578277456] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:43,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:23:43,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2023-12-24 21:23:43,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390500242] [2023-12-24 21:23:43,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:23:43,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-24 21:23:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:43,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-24 21:23:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1637, Unknown=40, NotChecked=252, Total=2070 [2023-12-24 21:23:43,380 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 27 states have internal predecessors, (33), 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:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:23:50,162 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-12-24 21:23:50,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 21:23:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 27 states have internal predecessors, (33), 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 26 [2023-12-24 21:23:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:23:50,164 INFO L225 Difference]: With dead ends: 50 [2023-12-24 21:23:50,164 INFO L226 Difference]: Without dead ends: 48 [2023-12-24 21:23:50,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=224, Invalid=2504, Unknown=40, NotChecked=312, Total=3080 [2023-12-24 21:23:50,166 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:23:50,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 167 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-24 21:23:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-24 21:23:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2023-12-24 21:23:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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:23:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-12-24 21:23:50,173 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 26 [2023-12-24 21:23:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:23:50,173 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-12-24 21:23:50,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 27 states have internal predecessors, (33), 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:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-12-24 21:23:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 21:23:50,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:23:50,174 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:50,182 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:50,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-24 21:23:50,575 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:50,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:23:50,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:23:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash 744913052, now seen corresponding path program 1 times [2023-12-24 21:23:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:23:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919174270] [2023-12-24 21:23:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:50,576 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,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:23:50,577 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:50,579 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:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:50,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-24 21:23:50,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:50,782 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:50,869 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:50,870 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:50,907 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:50,956 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,108 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:23:51,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 116 [2023-12-24 21:23:51,134 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 88 treesize of output 80 [2023-12-24 21:23:51,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-24 21:23:51,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-24 21:23:51,216 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:51,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:51,333 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 59 treesize of output 36 [2023-12-24 21:23:51,361 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:51,361 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:51,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:51,571 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-12-24 21:23:51,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 147 [2023-12-24 21:23:51,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 155 [2023-12-24 21:23:51,711 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:23:51,711 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:51,847 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 169 treesize of output 105 [2023-12-24 21:23:51,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:51,861 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-24 21:23:51,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 251 treesize of output 164 [2023-12-24 21:23:51,867 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 12 treesize of output 8 [2023-12-24 21:23:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:23:51,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:52,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (_ BitVec 32)) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32)))) (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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) v_ArrVal_567) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_564))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_565)))) .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:23:52,173 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| (_ BitVec 32)) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (_ BitVec 32)) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24|))) (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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_570) .cse2) .cse3) v_ArrVal_567) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_24| v_ArrVal_564))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_565)))) .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:23:52,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:23:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919174270] [2023-12-24 21:23:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919174270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769597369] [2023-12-24 21:23:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:23:52,177 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:23:52,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:23:52,178 INFO L229 MonitoredProcess]: Starting monitored process 8 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:52,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 21:23:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:23:52,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-24 21:23:52,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:23:52,548 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:52,710 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:23:52,711 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:52,792 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:52,870 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:53,078 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:23:53,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 116 [2023-12-24 21:23:53,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2023-12-24 21:23:53,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2023-12-24 21:23:53,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-24 21:23:53,194 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:57,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:57,434 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 59 treesize of output 36 [2023-12-24 21:23:57,452 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:23:57,452 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:57,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:57,748 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-12-24 21:23:57,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 147 [2023-12-24 21:23:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 132 [2023-12-24 21:23:57,960 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:23:57,960 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:58,149 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 172 treesize of output 108 [2023-12-24 21:23:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:23:58,157 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-24 21:23:58,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 152 [2023-12-24 21:23:58,160 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 12 treesize of output 8 [2023-12-24 21:23:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:23:58,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:23:58,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (_ BitVec 32)) (v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3) v_ArrVal_677) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_678))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_676)))) .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:23:58,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_676 (_ BitVec 32)) (v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| (_ BitVec 32)) (v_ArrVal_678 (Array (_ BitVec 32) (_ 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_681) .cse2) .cse3) v_ArrVal_677) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_678))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_676)))) .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 (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28|) (_ bv0 1))))) is different from false [2023-12-24 21:23:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [769597369] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:23:58,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:23:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 37 [2023-12-24 21:23:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497054036] [2023-12-24 21:23:58,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:23:58,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-24 21:23:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:23:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-24 21:23:58,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1484, Unknown=35, NotChecked=324, Total=1980 [2023-12-24 21:23:58,525 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 28 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:24:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:24:05,237 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-12-24 21:24:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 21:24:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 28 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:24:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:24:05,238 INFO L225 Difference]: With dead ends: 52 [2023-12-24 21:24:05,238 INFO L226 Difference]: Without dead ends: 49 [2023-12-24 21:24:05,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=198, Invalid=2126, Unknown=44, NotChecked=388, Total=2756 [2023-12-24 21:24:05,239 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:24:05,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 244 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 571 Invalid, 8 Unknown, 0 Unchecked, 6.0s Time] [2023-12-24 21:24:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-24 21:24:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2023-12-24 21:24:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-12-24 21:24:05,246 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2023-12-24 21:24:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:24:05,246 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-12-24 21:24:05,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 28 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:24:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-12-24 21:24:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:24:05,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:24:05,247 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:24:05,255 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:24:05,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:24:05,652 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:24:05,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:24:05,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:24:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1617509290, now seen corresponding path program 1 times [2023-12-24 21:24:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:24:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389767375] [2023-12-24 21:24:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:24:05,654 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:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:24:05,655 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05,657 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 (9)] Waiting until timeout for monitored process [2023-12-24 21:24:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:24:05,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 102 conjunts are in the unsatisfiable core [2023-12-24 21:24:05,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:24:05,990 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:06,009 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:06,219 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 21:24:06,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 21:24:06,246 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:24:06,246 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:06,311 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:06,318 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:06,338 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:06,410 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:24:06,425 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:06,432 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:06,831 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:24:06,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 258 treesize of output 196 [2023-12-24 21:24:06,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 21:24:06,876 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 140 treesize of output 122 [2023-12-24 21:24:06,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-24 21:24:06,895 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 32 treesize of output 19 [2023-12-24 21:24:06,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 41 [2023-12-24 21:24:07,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 33 [2023-12-24 21:24:07,045 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:07,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2023-12-24 21:24:07,056 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:07,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:07,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 54 [2023-12-24 21:24:07,319 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-24 21:24:07,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-24 21:24:07,384 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-24 21:24:07,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 58 [2023-12-24 21:24:07,441 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:24:07,442 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:08,174 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:24:08,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 233 [2023-12-24 21:24:09,605 INFO L349 Elim1Store]: treesize reduction 189, result has 7.8 percent of original size [2023-12-24 21:24:09,605 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 576 treesize of output 354 [2023-12-24 21:24:09,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2023-12-24 21:24:09,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 36 [2023-12-24 21:24:09,735 INFO L349 Elim1Store]: treesize reduction 84, result has 7.7 percent of original size [2023-12-24 21:24:09,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 92 [2023-12-24 21:24:09,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 92 [2023-12-24 21:24:09,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:09,769 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 61 treesize of output 19 [2023-12-24 21:24:09,919 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 99 treesize of output 67 [2023-12-24 21:24:10,134 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:24:10,134 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 64 treesize of output 35 [2023-12-24 21:24:10,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-12-24 21:24:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:24:10,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:24:10,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 32)) (v_ArrVal_819 (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_817 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_819)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_810) .cse2 v_ArrVal_807) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_812))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_820))) .cse5) .cse6)) (bvadd (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_809)))) (store .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_817))))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse4 v_ArrVal_818))) .cse5) .cse6) (_ bv8 32))))))) is different from false [2023-12-24 21:24:11,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 32)) (v_ArrVal_819 (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_817 (_ BitVec 32))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_819)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_810) .cse2 v_ArrVal_807) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_812))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_820))) .cse5) .cse6)) (bvadd (_ bv8 32) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_809)))) (store .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_817))))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse4 v_ArrVal_818))) .cse5) .cse6))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-12-24 21:24:12,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_830 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| (_ BitVec 32)) (v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_809 (_ BitVec 32)) (v_ArrVal_819 (_ BitVec 32)) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_817 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_831)) (.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_832)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select .cse5 .cse2) .cse4)) (.cse1 (select (select .cse10 .cse2) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_830) .cse0) .cse1 v_ArrVal_819)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_810) .cse2 v_ArrVal_807) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select .cse5 .cse0) .cse1 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| v_ArrVal_812))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_820))) .cse6) .cse7)) (bvadd (select (select (let ((.cse8 (let ((.cse9 (store (select .cse10 .cse0) .cse1 v_ArrVal_809))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32| (store (store (select (store .cse10 .cse0 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_32|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_817))))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse4 v_ArrVal_818))) .cse6) .cse7) (_ bv8 32)))))))) is different from false [2023-12-24 21:24:12,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:24:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389767375] [2023-12-24 21:24:12,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389767375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:24:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1805305865] [2023-12-24 21:24:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:24:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:24:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:24:12,297 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:12,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 21:24:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:24:12,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-24 21:24:12,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:24:12,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:24:12,779 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:12,990 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:24:12,990 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:13,005 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:13,111 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:13,128 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:13,135 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:13,268 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:24:13,280 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:13,286 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:13,735 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:24:13,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 255 treesize of output 193 [2023-12-24 21:24:13,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 21:24:13,761 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 149 treesize of output 127 [2023-12-24 21:24:13,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2023-12-24 21:24:13,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-24 21:24:13,836 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 32 treesize of output 19 [2023-12-24 21:24:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:14,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-24 21:24:14,052 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:24:14,052 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 187 treesize of output 106 [2023-12-24 21:24:14,060 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 21 treesize of output 11 [2023-12-24 21:24:14,064 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 27 treesize of output 19 [2023-12-24 21:24:14,068 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:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:18,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:18,404 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 26 treesize of output 21 [2023-12-24 21:24:18,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:18,431 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:24:18,432 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 195 treesize of output 120 [2023-12-24 21:24:18,455 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-24 21:24:18,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-24 21:24:18,495 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:24:18,495 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:18,513 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 18 treesize of output 26 [2023-12-24 21:24:18,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:19,870 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-12-24 21:24:19,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 324 treesize of output 259 [2023-12-24 21:24:19,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2023-12-24 21:24:19,985 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 43 treesize of output 43 [2023-12-24 21:24:20,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 239 [2023-12-24 21:24:20,043 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 37 treesize of output 19 [2023-12-24 21:24:20,054 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 8 treesize of output 1 [2023-12-24 21:24:20,674 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 318 treesize of output 202 [2023-12-24 21:24:21,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:21,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:21,468 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 30 treesize of output 24 [2023-12-24 21:24:21,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:21,479 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-24 21:24:21,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 440 treesize of output 315 [2023-12-24 21:24:21,484 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 15 treesize of output 11 [2023-12-24 21:24:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:24:21,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:24:21,694 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_970 (_ BitVec 32)) (v_ArrVal_963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_967 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_968)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_960) .cse2 v_ArrVal_957) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_965) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_958))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_970))) .cse5) .cse6)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_964) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_963) .cse2 (store (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_966)))) (store .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_967))) .cse2) .cse4 v_ArrVal_969)) .cse5) .cse6))))))) is different from false [2023-12-24 21:24:28,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_970 (_ BitVec 32)) (v_ArrVal_963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| (_ BitVec 32)) (v_ArrVal_981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_969 (_ BitVec 32)) (v_ArrVal_968 (_ BitVec 32)) (v_ArrVal_967 (_ BitVec 32)) (v_ArrVal_966 (_ BitVec 32)) (v_ArrVal_980 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36|))) (= (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_979)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_980) .cse2) .cse4)) (.cse1 (select (select .cse8 .cse2) .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_981) .cse0) .cse1 v_ArrVal_968)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_960) .cse2 v_ArrVal_957) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_965) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_958))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_970))) .cse5) .cse6)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_964) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_963) .cse2 (store (select (let ((.cse7 (store (select .cse8 .cse0) .cse1 v_ArrVal_966))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 .cse7) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| (store (store (select (store .cse8 .cse0 .cse7) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_967))) .cse2) .cse4 v_ArrVal_969)) .cse5) .cse6))))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-24 21:24:29,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1805305865] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:24:29,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:24:29,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2023-12-24 21:24:29,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225045301] [2023-12-24 21:24:29,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:24:29,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-24 21:24:29,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:24:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-24 21:24:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1742, Unknown=40, NotChecked=440, Total=2352 [2023-12-24 21:24:29,004 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 39 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 29 states have internal predecessors, (38), 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:44,521 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 162 DAG size of output: 140 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 21:24:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:24:47,042 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2023-12-24 21:24:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 21:24:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 29 states have internal predecessors, (38), 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 29 [2023-12-24 21:24:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:24:47,044 INFO L225 Difference]: With dead ends: 53 [2023-12-24 21:24:47,044 INFO L226 Difference]: Without dead ends: 51 [2023-12-24 21:24:47,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=239, Invalid=3261, Unknown=60, NotChecked=600, Total=4160 [2023-12-24 21:24:47,045 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:24:47,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 222 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 805 Invalid, 5 Unknown, 0 Unchecked, 8.6s Time] [2023-12-24 21:24:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-24 21:24:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2023-12-24 21:24:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-12-24 21:24:47,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2023-12-24 21:24:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:24:47,053 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-12-24 21:24:47,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 29 states have internal predecessors, (38), 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:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-12-24 21:24:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:24:47,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:24:47,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:24:47,062 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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 21:24:47,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-24 21:24:47,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:24:47,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:24:47,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:24:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash -349855678, now seen corresponding path program 1 times [2023-12-24 21:24:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:24:47,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684285799] [2023-12-24 21:24:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:24:47,463 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:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:24:47,464 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:47,465 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:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:24:47,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-24 21:24:47,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:24:47,739 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:47,860 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:24:47,860 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:47,915 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:47,921 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:47,969 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:47,976 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:48,181 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:24:48,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 156 [2023-12-24 21:24:48,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 68 [2023-12-24 21:24:48,194 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 123 treesize of output 109 [2023-12-24 21:24:48,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 24 [2023-12-24 21:24:48,209 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 18 treesize of output 26 [2023-12-24 21:24:48,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-24 21:24:48,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-24 21:24:48,289 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:48,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:24:48,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2023-12-24 21:24:48,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:48,423 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 59 treesize of output 36 [2023-12-24 21:24:48,445 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:24:48,445 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:48,464 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 31 treesize of output 20 [2023-12-24 21:24:48,841 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:24:48,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 370 treesize of output 210 [2023-12-24 21:24:49,522 INFO L349 Elim1Store]: treesize reduction 189, result has 7.8 percent of original size [2023-12-24 21:24:49,522 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 537 treesize of output 327 [2023-12-24 21:24:49,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 33 [2023-12-24 21:24:49,558 INFO L349 Elim1Store]: treesize reduction 84, result has 7.7 percent of original size [2023-12-24 21:24:49,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 95 [2023-12-24 21:24:49,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 84 [2023-12-24 21:24:49,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2023-12-24 21:24:49,850 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:24:49,850 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:49,941 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 67 treesize of output 43 [2023-12-24 21:24:49,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:24:49,947 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 40 treesize of output 19 [2023-12-24 21:24:49,979 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:49,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:24:50,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1095 (_ BitVec 32)) (v_ArrVal_1098 (_ BitVec 32)) (v_ArrVal_1101 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (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 (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1097))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1101))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 v_ArrVal_1098)))) (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse7) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1095))))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_ArrVal_1091))) .cse0) .cse2)))))))) is different from false [2023-12-24 21:24:50,405 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1095 (_ BitVec 32)) (v_ArrVal_1098 (_ BitVec 32)) (v_ArrVal_1101 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (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 (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1097))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1101))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 v_ArrVal_1098)))) (store .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse7) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1095))))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_ArrVal_1091))) .cse0) .cse2)))))))) is different from false [2023-12-24 21:24:50,735 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1095 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40| (_ BitVec 32)) (v_ArrVal_1098 (_ BitVec 32)) (v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (_ BitVec 32)) (v_ArrVal_1107 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40|) (_ 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 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40| v_ArrVal_1106)) (.cse7 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40| v_ArrVal_1107)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse6 (select (select .cse7 .cse4) .cse5)) (.cse8 (select (select .cse11 .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select .cse7 .cse6) .cse8 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40| v_ArrVal_1097))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1101))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (let ((.cse9 (let ((.cse10 (store (select .cse11 .cse6) .cse8 v_ArrVal_1098))) (store (store |c_#memory_$Pointer$#1.offset| .cse6 .cse10) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40| (store (store (select (store .cse11 .cse6 .cse10) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_40|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse8) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1095))))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_1091))) .cse0) .cse2))))))))) is different from false [2023-12-24 21:24:50,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:24:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684285799] [2023-12-24 21:24:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684285799] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:24:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [992799859] [2023-12-24 21:24:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:24:50,832 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:24:50,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:24:50,833 INFO L229 MonitoredProcess]: Starting monitored process 12 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:24:50,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-24 21:24:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:24:51,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-24 21:24:51,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:24:51,305 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:51,468 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:24:51,469 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:51,563 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:51,571 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:51,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:24:51,679 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:51,950 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:24:51,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 156 [2023-12-24 21:24:51,967 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 128 treesize of output 112 [2023-12-24 21:24:51,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-24 21:24:51,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2023-12-24 21:24:51,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-24 21:24:52,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:52,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-24 21:24:52,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-24 21:24:52,148 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:56,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:56,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:56,396 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 26 treesize of output 21 [2023-12-24 21:24:56,407 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 18 treesize of output 26 [2023-12-24 21:24:56,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:24:56,417 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 59 treesize of output 36 [2023-12-24 21:24:56,439 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:24:56,439 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:56,873 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:24:56,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 139 [2023-12-24 21:24:57,376 INFO L349 Elim1Store]: treesize reduction 189, result has 7.8 percent of original size [2023-12-24 21:24:57,376 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 354 treesize of output 232 [2023-12-24 21:24:57,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 115 [2023-12-24 21:24:57,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 317 [2023-12-24 21:24:57,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 188 [2023-12-24 21:24:57,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 52 [2023-12-24 21:24:57,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2023-12-24 21:25:09,911 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:25:09,911 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:25:09,915 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:25:10,230 INFO L349 Elim1Store]: treesize reduction 75, result has 33.6 percent of original size [2023-12-24 21:25:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2488 treesize of output 1591 [2023-12-24 21:25:10,254 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 187 treesize of output 147 [2023-12-24 21:25:10,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-12-24 21:25:10,368 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 15 treesize of output 11 [2023-12-24 21:25:10,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 21:25:10,372 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:25:10,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:25:16,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1224 (_ BitVec 32)) (v_ArrVal_1223 (_ BitVec 32)) (v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1220 (_ BitVec 32)) (v_ArrVal_1222 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (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 (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1226))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1220))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_1221) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1218) .cse4 (store (select (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 v_ArrVal_1224)))) (store .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse7) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1222))) .cse4) .cse5 v_ArrVal_1223)) .cse0) .cse2)))))))) is different from false [2023-12-24 21:25:17,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1224 (_ BitVec 32)) (v_ArrVal_1223 (_ BitVec 32)) (v_ArrVal_1232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44| (_ BitVec 32)) (v_ArrVal_1231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1220 (_ BitVec 32)) (v_ArrVal_1222 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44|))) (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 (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44| v_ArrVal_1232)) (.cse7 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44| v_ArrVal_1231)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse6 (select (select .cse7 .cse4) .cse5)) (.cse8 (select (select .cse10 .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select .cse7 .cse6) .cse8 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44| v_ArrVal_1226))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1220))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_1221) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44| v_ArrVal_1218) .cse4 (store (select (let ((.cse9 (store (select .cse10 .cse6) .cse8 v_ArrVal_1224))) (store (store |c_#memory_$Pointer$#1.offset| .cse6 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44| (store (store (select (store .cse10 .cse6 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_44|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) .cse8) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1222))) .cse4) .cse5 v_ArrVal_1223)) .cse0) .cse2))))))))) is different from false [2023-12-24 21:25:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [992799859] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:25:17,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:25:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 39 [2023-12-24 21:25:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192850763] [2023-12-24 21:25:17,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:25:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-24 21:25:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:25:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-24 21:25:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1639, Unknown=45, NotChecked=430, Total=2256 [2023-12-24 21:25:17,050 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 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:25:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:25:36,971 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-12-24 21:25:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 21:25:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-12-24 21:25:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:25:36,973 INFO L225 Difference]: With dead ends: 55 [2023-12-24 21:25:36,973 INFO L226 Difference]: Without dead ends: 52 [2023-12-24 21:25:36,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=235, Invalid=2593, Unknown=54, NotChecked=540, Total=3422 [2023-12-24 21:25:36,974 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-24 21:25:36,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 221 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 631 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-12-24 21:25:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-24 21:25:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2023-12-24 21:25:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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:25:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-24 21:25:36,981 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 31 [2023-12-24 21:25:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:25:36,981 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-24 21:25:36,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 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:25:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-24 21:25:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 21:25:36,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:25:36,982 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:25:36,991 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:25:37,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:25:37,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:25:37,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:25:37,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:25:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2039417028, now seen corresponding path program 2 times [2023-12-24 21:25:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:25:37,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596686886] [2023-12-24 21:25:37,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:25:37,389 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:25:37,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:25:37,390 INFO L229 MonitoredProcess]: Starting monitored process 13 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:25:37,393 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 (13)] Waiting until timeout for monitored process [2023-12-24 21:25:37,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:25:37,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:25:37,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-24 21:25:37,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:25:37,739 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:25:37,845 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:25:37,845 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:25:37,896 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:25:37,909 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:25:37,954 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:25:37,967 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:25:38,187 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:25:38,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 172 [2023-12-24 21:25:38,200 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 156 treesize of output 136 [2023-12-24 21:25:38,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2023-12-24 21:25:38,223 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 32 treesize of output 31 [2023-12-24 21:25:38,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:25:38,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-24 21:25:38,367 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:25:38,367 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 172 treesize of output 97 [2023-12-24 21:25:38,373 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 21 treesize of output 11 [2023-12-24 21:25:38,377 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 12 [2023-12-24 21:25:38,473 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:25:38,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:25:38,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:25:38,565 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 30 treesize of output 25 [2023-12-24 21:25:38,569 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 22 treesize of output 28 [2023-12-24 21:25:38,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-12-24 21:25:38,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:25:38,595 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:25:38,596 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 180 treesize of output 111 [2023-12-24 21:25:38,626 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:25:38,626 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:25:39,485 INFO L349 Elim1Store]: treesize reduction 104, result has 18.1 percent of original size [2023-12-24 21:25:39,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 419 treesize of output 267 [2023-12-24 21:25:40,383 INFO L349 Elim1Store]: treesize reduction 189, result has 7.8 percent of original size [2023-12-24 21:25:40,384 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 781 treesize of output 551 [2023-12-24 21:25:40,467 INFO L349 Elim1Store]: treesize reduction 148, result has 15.9 percent of original size [2023-12-24 21:25:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 571 treesize of output 270 [2023-12-24 21:25:40,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 343 [2023-12-24 21:25:40,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:25:40,503 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 140 treesize of output 14 [2023-12-24 21:25:40,513 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 85 treesize of output 31 [2023-12-24 21:25:40,663 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 279 treesize of output 175 [2023-12-24 21:25:41,052 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-24 21:25:41,052 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 127 [2023-12-24 21:25:41,060 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-12-24 21:25:41,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 43 [2023-12-24 21:25:41,068 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 23 treesize of output 17 [2023-12-24 21:25:41,071 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 6 treesize of output 4 [2023-12-24 21:25:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:25:41,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:25:41,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse10))) (let ((.cse0 (store |c_#memory_int#1| .cse11 v_ArrVal_1353)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1 (select v_ArrVal_1343 .cse1)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1343 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1343)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse10))) (let ((.cse6 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| .cse11 (store (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (store .cse14 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1 .cse12) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1346))))) (store .cse13 .cse2 (store (select .cse13 .cse2) .cse10 v_ArrVal_1347)))) (.cse3 (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| .cse11 (store (select |c_#memory_$Pointer$#1.base| .cse11) .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1354))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse10 v_ArrVal_1345)))) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (select (select .cse6 .cse7) .cse8))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1343) .cse2 v_ArrVal_1352) (select (select .cse3 .cse4) .cse5)) (bvadd (select (select .cse6 .cse4) .cse5) (_ bv8 32)))))))))))) is different from false [2023-12-24 21:25:42,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse10))) (let ((.cse0 (store |c_#memory_int#1| .cse11 v_ArrVal_1353)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (or (not (= v_ArrVal_1343 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse1 (select v_ArrVal_1343 .cse1)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select v_ArrVal_1343 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse10))) (let ((.cse6 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| .cse11 (store (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (store .cse14 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse1 .cse12) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1346))))) (store .cse13 .cse2 (store (select .cse13 .cse2) .cse10 v_ArrVal_1347)))) (.cse3 (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| .cse11 (store (select |c_#memory_$Pointer$#1.base| .cse11) .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1354))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse10 v_ArrVal_1345)))) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (select (select .cse6 .cse7) .cse8))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1343) .cse2 v_ArrVal_1352) (select (select .cse3 .cse4) .cse5)) (bvadd (_ bv8 32) (select (select .cse6 .cse4) .cse5)))))))))))) is different from false [2023-12-24 21:25:44,676 INFO L349 Elim1Store]: treesize reduction 3033, result has 50.1 percent of original size [2023-12-24 21:25:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16950 treesize of output 18472 [2023-12-24 21:25:44,982 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 15392 treesize of output 12000 [2023-12-24 21:25:45,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:25:45,356 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 16862 treesize of output 16862 [2023-12-24 21:25:45,635 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 39368 treesize of output 35128 [2023-12-24 21:25:46,007 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 852 treesize of output 4 [2023-12-24 21:25:51,624 INFO L224 Elim1Store]: Index analysis took 202 ms [2023-12-24 21:25:51,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:25:51,854 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 21265 treesize of output 20417 [2023-12-24 21:26:01,644 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse7 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse6 (select (select .cse7 .cse4) .cse5)) (.cse8 (select (select .cse11 .cse4) .cse5))) (select (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select .cse7 .cse6) .cse8 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1345))))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (let ((.cse9 (let ((.cse10 (store (select .cse11 .cse6) .cse8 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse6 .cse10) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse11 .cse6 .cse10) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse8) (_ bv0 32) v_ArrVal_1346))))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_1347))) .cse1) .cse2)))) .cse4))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse18 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse15 (select (select .cse18 .cse4) .cse5)) (.cse19 (select (select .cse22 .cse4) .cse5))) (let ((.cse12 (let ((.cse20 (let ((.cse21 (store (select .cse22 .cse15) .cse19 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse15 .cse21) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse22 .cse15 .cse21) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse19) (_ bv0 32) v_ArrVal_1346))))) (store .cse20 .cse4 (store (select .cse20 .cse4) .cse5 v_ArrVal_1347)))) (.cse16 (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| .cse15 (store (select .cse18 .cse15) .cse19 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse17 .cse4 (store (select .cse17 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse13 (select (select .cse16 .cse1) .cse2)) (.cse14 (select (select .cse12 .cse1) .cse2))) (or (not (= (bvadd (_ bv4 32) (select (select .cse12 .cse13) .cse14)) (_ bv0 32))) (= .cse15 (select (select .cse16 .cse13) .cse14)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse29 (select (select .cse30 .cse4) .cse5)) (.cse31 (select (select .cse34 .cse4) .cse5))) (let ((.cse27 (let ((.cse32 (let ((.cse33 (store (select .cse34 .cse29) .cse31 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse29 .cse33) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse34 .cse29 .cse33) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse31) (_ bv0 32) v_ArrVal_1346))))) (store .cse32 .cse4 (store (select .cse32 .cse4) .cse5 v_ArrVal_1347)))) (.cse24 (let ((.cse28 (store (store |c_#memory_$Pointer$#1.base| .cse29 (store (select .cse30 .cse29) .cse31 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse28 .cse4 (store (select .cse28 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse25 (select (select .cse24 .cse1) .cse2)) (.cse26 (select (select .cse27 .cse1) .cse2))) (let ((.cse23 (select (select .cse27 .cse25) .cse26))) (or (= (bvadd (_ bv8 32) .cse23) (_ bv0 32)) (= .cse23 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse23) (_ bv0 32)) (= (select (select .cse24 .cse25) .cse26) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362) .cse4) .cse5) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse35 (select (select .cse38 .cse4) .cse5))) (= .cse35 (let ((.cse42 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363))) (let ((.cse39 (select (select .cse42 .cse4) .cse5))) (select (let ((.cse36 (let ((.cse37 (store (store |c_#memory_$Pointer$#1.base| .cse35 (store (select .cse38 .cse35) .cse39 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse37 .cse4 (store (select .cse37 .cse4) .cse5 v_ArrVal_1345))))) (select .cse36 (select (select .cse36 .cse1) .cse2))) (select (select (let ((.cse40 (let ((.cse41 (store (select .cse42 .cse35) .cse39 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse35 .cse41) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse42 .cse35 .cse41) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse39) (_ bv0 32) v_ArrVal_1346))))) (store .cse40 .cse4 (store (select .cse40 .cse4) .cse5 v_ArrVal_1347))) .cse1) .cse2))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|)) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse50 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse46 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse45 (select (select .cse46 .cse4) .cse5)) (.cse47 (select (select .cse50 .cse4) .cse5))) (select (let ((.cse43 (let ((.cse44 (store (store |c_#memory_$Pointer$#1.base| .cse45 (store (select .cse46 .cse45) .cse47 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse44 .cse4 (store (select .cse44 .cse4) .cse5 v_ArrVal_1345))))) (select .cse43 (select (select .cse43 .cse1) .cse2))) (select (select (let ((.cse48 (let ((.cse49 (store (select .cse50 .cse45) .cse47 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse45 .cse49) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse50 .cse45 .cse49) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse47) (_ bv0 32) v_ArrVal_1346))))) (store .cse48 .cse4 (store (select .cse48 .cse4) .cse5 v_ArrVal_1347))) .cse1) .cse2)))) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse57 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse56 (select (select .cse57 .cse4) .cse5)) (.cse58 (select (select .cse61 .cse4) .cse5))) (let ((.cse54 (let ((.cse59 (let ((.cse60 (store (select .cse61 .cse56) .cse58 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse56 .cse60) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse61 .cse56 .cse60) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse58) (_ bv0 32) v_ArrVal_1346))))) (store .cse59 .cse4 (store (select .cse59 .cse4) .cse5 v_ArrVal_1347)))) (.cse51 (let ((.cse55 (store (store |c_#memory_$Pointer$#1.base| .cse56 (store (select .cse57 .cse56) .cse58 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse55 .cse4 (store (select .cse55 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse52 (select (select .cse51 .cse1) .cse2)) (.cse53 (select (select .cse54 .cse1) .cse2))) (or (= (select (select .cse51 .cse52) .cse53) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (not (= (bvadd (_ bv8 32) (select (select .cse54 .cse52) .cse53)) (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))) (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse68 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse62 (select (select .cse68 .cse4) .cse5)) (.cse69 (select (select .cse72 .cse4) .cse5))) (let ((.cse66 (let ((.cse70 (let ((.cse71 (store (select .cse72 .cse62) .cse69 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse62 .cse71) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse72 .cse62 .cse71) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse69) (_ bv0 32) v_ArrVal_1346))))) (store .cse70 .cse4 (store (select .cse70 .cse4) .cse5 v_ArrVal_1347)))) (.cse63 (let ((.cse67 (store (store |c_#memory_$Pointer$#1.base| .cse62 (store (select .cse68 .cse62) .cse69 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse67 .cse4 (store (select .cse67 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse64 (select (select .cse63 .cse1) .cse2)) (.cse65 (select (select .cse66 .cse1) .cse2))) (or (= .cse62 (select (select .cse63 .cse64) .cse65)) (not (= (bvadd (_ bv8 32) (select (select .cse66 .cse64) .cse65)) (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse79 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse78 (select (select .cse79 .cse4) .cse5)) (.cse80 (select (select .cse83 .cse4) .cse5))) (let ((.cse73 (let ((.cse81 (let ((.cse82 (store (select .cse83 .cse78) .cse80 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse78 .cse82) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse83 .cse78 .cse82) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse80) (_ bv0 32) v_ArrVal_1346))))) (store .cse81 .cse4 (store (select .cse81 .cse4) .cse5 v_ArrVal_1347)))) (.cse76 (let ((.cse77 (store (store |c_#memory_$Pointer$#1.base| .cse78 (store (select .cse79 .cse78) .cse80 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse77 .cse4 (store (select .cse77 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse74 (select (select .cse76 .cse1) .cse2)) (.cse75 (select (select .cse73 .cse1) .cse2))) (or (not (= (bvadd (_ bv4 32) (select (select .cse73 .cse74) .cse75)) (_ bv0 32))) (= (select (select .cse76 .cse74) .cse75) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))))) is different from false [2023-12-24 21:26:05,664 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse7 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse6 (select (select .cse7 .cse4) .cse5)) (.cse8 (select (select .cse11 .cse4) .cse5))) (select (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select .cse7 .cse6) .cse8 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1345))))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (let ((.cse9 (let ((.cse10 (store (select .cse11 .cse6) .cse8 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse6 .cse10) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse11 .cse6 .cse10) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse8) (_ bv0 32) v_ArrVal_1346))))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_1347))) .cse1) .cse2)))) .cse4))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse18 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse15 (select (select .cse18 .cse4) .cse5)) (.cse19 (select (select .cse22 .cse4) .cse5))) (let ((.cse12 (let ((.cse20 (let ((.cse21 (store (select .cse22 .cse15) .cse19 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse15 .cse21) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse22 .cse15 .cse21) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse19) (_ bv0 32) v_ArrVal_1346))))) (store .cse20 .cse4 (store (select .cse20 .cse4) .cse5 v_ArrVal_1347)))) (.cse16 (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| .cse15 (store (select .cse18 .cse15) .cse19 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse17 .cse4 (store (select .cse17 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse13 (select (select .cse16 .cse1) .cse2)) (.cse14 (select (select .cse12 .cse1) .cse2))) (or (not (= (bvadd (_ bv4 32) (select (select .cse12 .cse13) .cse14)) (_ bv0 32))) (= .cse15 (select (select .cse16 .cse13) .cse14)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse29 (select (select .cse30 .cse4) .cse5)) (.cse31 (select (select .cse34 .cse4) .cse5))) (let ((.cse27 (let ((.cse32 (let ((.cse33 (store (select .cse34 .cse29) .cse31 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse29 .cse33) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse34 .cse29 .cse33) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse31) (_ bv0 32) v_ArrVal_1346))))) (store .cse32 .cse4 (store (select .cse32 .cse4) .cse5 v_ArrVal_1347)))) (.cse24 (let ((.cse28 (store (store |c_#memory_$Pointer$#1.base| .cse29 (store (select .cse30 .cse29) .cse31 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse28 .cse4 (store (select .cse28 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse25 (select (select .cse24 .cse1) .cse2)) (.cse26 (select (select .cse27 .cse1) .cse2))) (let ((.cse23 (select (select .cse27 .cse25) .cse26))) (or (= (bvadd (_ bv8 32) .cse23) (_ bv0 32)) (= .cse23 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse23) (_ bv0 32)) (= (select (select .cse24 .cse25) .cse26) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362) .cse4) .cse5) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse35 (select (select .cse38 .cse4) .cse5))) (= .cse35 (let ((.cse42 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363))) (let ((.cse39 (select (select .cse42 .cse4) .cse5))) (select (let ((.cse36 (let ((.cse37 (store (store |c_#memory_$Pointer$#1.base| .cse35 (store (select .cse38 .cse35) .cse39 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse37 .cse4 (store (select .cse37 .cse4) .cse5 v_ArrVal_1345))))) (select .cse36 (select (select .cse36 .cse1) .cse2))) (select (select (let ((.cse40 (let ((.cse41 (store (select .cse42 .cse35) .cse39 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse35 .cse41) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse42 .cse35 .cse41) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse39) (_ bv0 32) v_ArrVal_1346))))) (store .cse40 .cse4 (store (select .cse40 .cse4) .cse5 v_ArrVal_1347))) .cse1) .cse2))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|)) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse50 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse46 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse45 (select (select .cse46 .cse4) .cse5)) (.cse47 (select (select .cse50 .cse4) .cse5))) (select (let ((.cse43 (let ((.cse44 (store (store |c_#memory_$Pointer$#1.base| .cse45 (store (select .cse46 .cse45) .cse47 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse44 .cse4 (store (select .cse44 .cse4) .cse5 v_ArrVal_1345))))) (select .cse43 (select (select .cse43 .cse1) .cse2))) (select (select (let ((.cse48 (let ((.cse49 (store (select .cse50 .cse45) .cse47 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse45 .cse49) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse50 .cse45 .cse49) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse47) (_ bv0 32) v_ArrVal_1346))))) (store .cse48 .cse4 (store (select .cse48 .cse4) .cse5 v_ArrVal_1347))) .cse1) .cse2)))) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse57 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse56 (select (select .cse57 .cse4) .cse5)) (.cse58 (select (select .cse61 .cse4) .cse5))) (let ((.cse54 (let ((.cse59 (let ((.cse60 (store (select .cse61 .cse56) .cse58 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse56 .cse60) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse61 .cse56 .cse60) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse58) (_ bv0 32) v_ArrVal_1346))))) (store .cse59 .cse4 (store (select .cse59 .cse4) .cse5 v_ArrVal_1347)))) (.cse51 (let ((.cse55 (store (store |c_#memory_$Pointer$#1.base| .cse56 (store (select .cse57 .cse56) .cse58 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse55 .cse4 (store (select .cse55 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse52 (select (select .cse51 .cse1) .cse2)) (.cse53 (select (select .cse54 .cse1) .cse2))) (or (= (select (select .cse51 .cse52) .cse53) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (not (= (bvadd (_ bv8 32) (select (select .cse54 .cse52) .cse53)) (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))) (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse68 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse62 (select (select .cse68 .cse4) .cse5)) (.cse69 (select (select .cse72 .cse4) .cse5))) (let ((.cse66 (let ((.cse70 (let ((.cse71 (store (select .cse72 .cse62) .cse69 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse62 .cse71) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse72 .cse62 .cse71) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse69) (_ bv0 32) v_ArrVal_1346))))) (store .cse70 .cse4 (store (select .cse70 .cse4) .cse5 v_ArrVal_1347)))) (.cse63 (let ((.cse67 (store (store |c_#memory_$Pointer$#1.base| .cse62 (store (select .cse68 .cse62) .cse69 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse67 .cse4 (store (select .cse67 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse64 (select (select .cse63 .cse1) .cse2)) (.cse65 (select (select .cse66 .cse1) .cse2))) (or (= .cse62 (select (select .cse63 .cse64) .cse65)) (not (= (bvadd (_ bv8 32) (select (select .cse66 .cse64) .cse65)) (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (_ BitVec 32))) (or (forall ((v_ArrVal_1345 (_ BitVec 32)) (v_ArrVal_1347 (_ BitVec 32)) (v_ArrVal_1346 (_ BitVec 32)) (v_ArrVal_1354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1363)) (.cse79 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1362))) (let ((.cse78 (select (select .cse79 .cse4) .cse5)) (.cse80 (select (select .cse83 .cse4) .cse5))) (let ((.cse73 (let ((.cse81 (let ((.cse82 (store (select .cse83 .cse78) .cse80 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse78 .cse82) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| (store (store (select (store .cse83 .cse78 .cse82) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|) (_ bv4 32) .cse80) (_ bv0 32) v_ArrVal_1346))))) (store .cse81 .cse4 (store (select .cse81 .cse4) .cse5 v_ArrVal_1347)))) (.cse76 (let ((.cse77 (store (store |c_#memory_$Pointer$#1.base| .cse78 (store (select .cse79 .cse78) .cse80 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48| v_ArrVal_1354))) (store .cse77 .cse4 (store (select .cse77 .cse4) .cse5 v_ArrVal_1345))))) (let ((.cse74 (select (select .cse76 .cse1) .cse2)) (.cse75 (select (select .cse73 .cse1) .cse2))) (or (not (= (bvadd (_ bv4 32) (select (select .cse73 .cse74) .cse75)) (_ bv0 32))) (= (select (select .cse76 .cse74) .cse75) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_48|))))))) is different from true [2023-12-24 21:26:05,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:26:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596686886] [2023-12-24 21:26:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596686886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:26:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1628230170] [2023-12-24 21:26:05,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:26:05,667 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:26:05,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:26:05,668 INFO L229 MonitoredProcess]: Starting monitored process 14 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:26:05,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 21:26:06,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:26:06,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:26:06,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 102 conjunts are in the unsatisfiable core [2023-12-24 21:26:06,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:26:06,504 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:26:08,130 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:26:08,130 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:26:08,672 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:26:08,708 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:26:09,191 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:26:09,282 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:26:10,613 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-24 21:26:10,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 156 [2023-12-24 21:26:10,629 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 128 treesize of output 112 [2023-12-24 21:26:10,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-24 21:26:10,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2023-12-24 21:26:10,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-24 21:26:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:11,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-24 21:26:11,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-12-24 21:26:11,407 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:26:12,155 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:26:16,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:16,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:16,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-24 21:26:16,687 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 18 treesize of output 26 [2023-12-24 21:26:16,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:16,749 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 59 treesize of output 36 [2023-12-24 21:26:16,895 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:26:16,895 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:26:19,208 INFO L349 Elim1Store]: treesize reduction 133, result has 12.5 percent of original size [2023-12-24 21:26:19,208 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 3 case distinctions, treesize of input 678 treesize of output 244 [2023-12-24 21:26:19,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:19,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:19,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:19,265 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 82 treesize of output 42 [2023-12-24 21:26:19,280 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 61 treesize of output 23 [2023-12-24 21:26:19,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:19,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:26:19,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 71 [2023-12-24 21:26:23,082 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 172 treesize of output 120 [2023-12-24 21:26:23,206 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-24 21:26:23,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 56 [2023-12-24 21:26:23,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 21:26:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:26:23,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:26:26,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (bvadd (_ bv4 32) .cse25))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse13)) (.cse23 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse13))) (let ((.cse14 (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse23 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (store .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1 .cse23) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse25)))) (.cse11 (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse23 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1 .cse2) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse3))))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select .cse11 .cse3)) (.cse15 (select .cse14 .cse3))) (and (forall ((v_ArrVal_1476 (_ BitVec 32)) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1480 (_ BitVec 32)) (v_DerPreprocessor_36 (_ BitVec 32)) (v_ArrVal_1481 (_ BitVec 32))) (let ((.cse5 (store .cse14 .cse3 (store .cse15 .cse13 v_ArrVal_1481))) (.cse9 (store .cse11 .cse3 (store .cse12 .cse13 v_ArrVal_1480)))) (let ((.cse6 (select (select .cse9 .cse8) .cse10)) (.cse7 (select (select .cse5 .cse8) .cse10))) (let ((.cse4 (select (select .cse9 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int#1| .cse2 v_ArrVal_1486))) (store .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1 v_DerPreprocessor_36) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1476))) .cse3 v_ArrVal_1491) .cse4) (bvadd (_ bv8 32) (select (select .cse5 .cse6) .cse7)))) (= .cse8 .cse4)))))) (forall ((v_ArrVal_1476 (_ BitVec 32)) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1480 (_ BitVec 32)) (v_DerPreprocessor_36 (_ BitVec 32)) (v_ArrVal_1481 (_ BitVec 32))) (let ((.cse21 (store .cse14 .cse3 (store .cse15 .cse13 v_ArrVal_1481))) (.cse18 (store .cse11 .cse3 (store .cse12 .cse13 v_ArrVal_1480)))) (let ((.cse19 (select (select .cse18 .cse8) .cse10)) (.cse20 (select (select .cse21 .cse8) .cse10))) (let ((.cse16 (select (select .cse21 .cse19) .cse20))) (or (= .cse10 .cse16) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| .cse2 v_ArrVal_1486))) (store .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse1 v_DerPreprocessor_36) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1476))) .cse3 v_ArrVal_1491) (select (select .cse18 .cse19) .cse20)) (bvadd (_ bv8 32) .cse16)))))))))))))) is different from false [2023-12-24 21:27:11,979 WARN L293 SmtUtils]: Spent 30.70s on a formula simplification. DAG size of input: 117 DAG size of output: 111 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:27:11,980 INFO L349 Elim1Store]: treesize reduction 8418, result has 60.0 percent of original size [2023-12-24 21:27:11,980 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 4 case distinctions, treesize of input 103729 treesize of output 107893 [2023-12-24 21:27:12,423 INFO L224 Elim1Store]: Index analysis took 215 ms [2023-12-24 21:27:14,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:27:14,511 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 59382 treesize of output 61488 [2023-12-24 21:27:15,777 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 63607 treesize of output 60451 [2023-12-24 21:27:15,943 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 56225 treesize of output 52017 [2023-12-24 21:27:17,139 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 64683 treesize of output 61527 [2023-12-24 21:27:17,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57301 treesize of output 53093 [2023-12-24 21:28:03,488 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 1056 treesize of output 4 [2023-12-24 21:33:21,137 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:21,137 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 3164 treesize of output 8 [2023-12-24 21:33:21,905 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:21,905 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 3164 treesize of output 8 [2023-12-24 21:33:22,478 INFO L224 Elim1Store]: Index analysis took 152 ms [2023-12-24 21:33:22,649 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:22,649 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 2108 treesize of output 4 [2023-12-24 21:33:23,419 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:23,419 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 2108 treesize of output 4 [2023-12-24 21:33:28,412 INFO L224 Elim1Store]: Index analysis took 345 ms [2023-12-24 21:33:28,567 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:28,567 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 2108 treesize of output 4 [2023-12-24 21:33:30,123 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 1055 treesize of output 3 [2023-12-24 21:33:47,689 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 1055 treesize of output 3 [2023-12-24 21:33:50,127 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 1055 treesize of output 3 [2023-12-24 21:33:50,631 INFO L224 Elim1Store]: Index analysis took 127 ms [2023-12-24 21:33:50,730 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:50,731 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 3164 treesize of output 8 [2023-12-24 21:33:53,171 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 1055 treesize of output 3 [2023-12-24 21:33:55,638 INFO L349 Elim1Store]: treesize reduction 2103, result has 0.0 percent of original size [2023-12-24 21:33:55,638 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 2108 treesize of output 4 [2023-12-24 21:34:04,611 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 1055 treesize of output 3 Received shutdown request... [2023-12-24 21:37:51,791 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:37:51,791 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 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:37:51,791 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:37:52,801 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 (13)] Ended with exit code 0 [2023-12-24 21:37:52,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-24 21:37:52,992 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:37:53,069 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:37:53,070 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 21:37:53,070 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 62 more [2023-12-24 21:37:53,073 INFO L158 Benchmark]: Toolchain (without parser) took 877784.30ms. Allocated memory was 178.3MB in the beginning and 231.7MB in the end (delta: 53.5MB). Free memory was 142.3MB in the beginning and 109.3MB in the end (delta: 33.0MB). Peak memory consumption was 147.5MB. Max. memory is 8.0GB. [2023-12-24 21:37:53,073 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 178.3MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:37:53,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.00ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 122.8MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:37:53,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.76ms. Allocated memory is still 178.3MB. Free memory was 122.8MB in the beginning and 120.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:37:53,074 INFO L158 Benchmark]: Boogie Preprocessor took 74.72ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 116.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 21:37:53,074 INFO L158 Benchmark]: RCFGBuilder took 495.23ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 93.9MB in the end (delta: 22.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-24 21:37:53,074 INFO L158 Benchmark]: TraceAbstraction took 876781.91ms. Allocated memory was 178.3MB in the beginning and 231.7MB in the end (delta: 53.5MB). Free memory was 93.0MB in the beginning and 109.3MB in the end (delta: -16.3MB). Peak memory consumption was 98.2MB. Max. memory is 8.0GB. [2023-12-24 21:37:53,074 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.42ms. Allocated memory is still 178.3MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 392.00ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 122.8MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.76ms. Allocated memory is still 178.3MB. Free memory was 122.8MB in the beginning and 120.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.72ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 116.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 495.23ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 93.9MB in the end (delta: 22.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 876781.91ms. Allocated memory was 178.3MB in the beginning and 231.7MB in the end (delta: 53.5MB). Free memory was 93.0MB in the beginning and 109.3MB in the end (delta: -16.3MB). Peak memory consumption was 98.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown