/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/dll2n_append_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:29:10,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:29:10,158 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:29:10,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:29:10,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:29:10,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:29:10,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:29:10,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:29:10,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:29:10,199 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:29:10,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:29:10,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:29:10,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:29:10,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:29:10,201 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:29:10,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:29:10,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:29:10,202 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:29:10,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:29:10,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:29:10,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:29:10,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:29:10,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:29:10,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:29:10,204 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:29:10,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:29:10,204 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:29:10,204 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:29:10,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:29:10,204 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:29:10,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:29:10,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:29:10,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:29:10,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:29:10,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:10,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:29:10,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:29:10,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:29:10,206 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:29:10,206 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:10,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:29:10,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:29:10,207 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:29:10,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:29:10,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:29:10,207 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:29:10,208 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:29:10,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:29:10,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:29:10,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:29:10,391 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:29:10,391 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:29:10,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.i [2023-12-24 21:29:11,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:29:11,617 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:29:11,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal.i [2023-12-24 21:29:11,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b1f9dd8/8b4f2e41955a4ef3b5133661f367bf7c/FLAGdd1207427 [2023-12-24 21:29:11,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b1f9dd8/8b4f2e41955a4ef3b5133661f367bf7c [2023-12-24 21:29:11,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:29:11,647 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:29:11,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:11,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:29:11,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:29:11,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:11" (1/1) ... [2023-12-24 21:29:11,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9019d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:11, skipping insertion in model container [2023-12-24 21:29:11,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:11" (1/1) ... [2023-12-24 21:29:11,692 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:29:11,936 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/dll2n_append_unequal.i[24457,24470] [2023-12-24 21:29:11,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:11,948 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:29:12,001 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/dll2n_append_unequal.i[24457,24470] [2023-12-24 21:29:12,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:12,023 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:29:12,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12 WrapperNode [2023-12-24 21:29:12,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:12,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:12,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:29:12,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:29:12,031 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:29:12" (1/1) ... [2023-12-24 21:29:12,052 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:29:12" (1/1) ... [2023-12-24 21:29:12,070 INFO L138 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-12-24 21:29:12,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:12,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:29:12,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:29:12,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:29:12,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,102 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2023-12-24 21:29:12,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:29:12,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:29:12,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:29:12,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:29:12,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (1/1) ... [2023-12-24 21:29:12,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:29:12,153 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:29:12,161 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:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:29:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:29:12,177 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:29:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:29:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:29:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:29:12,299 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:29:12,301 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:29:12,608 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:29:12,639 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:29:12,639 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 21:29:12,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:12 BoogieIcfgContainer [2023-12-24 21:29:12,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:29:12,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:29:12,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:29:12,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:29:12,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:29:11" (1/3) ... [2023-12-24 21:29:12,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188c5078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:12, skipping insertion in model container [2023-12-24 21:29:12,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:12" (2/3) ... [2023-12-24 21:29:12,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188c5078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:12, skipping insertion in model container [2023-12-24 21:29:12,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:12" (3/3) ... [2023-12-24 21:29:12,645 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2023-12-24 21:29:12,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:29:12,659 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:29:12,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:29:12,712 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;@1ded6f1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:29:12,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:29:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:29:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 21:29:12,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:12,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:12,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:12,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 677653752, now seen corresponding path program 1 times [2023-12-24 21:29:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809896674] [2023-12-24 21:29:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:12,743 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:29:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:12,746 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:29:12,747 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:29:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:12,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:29:12,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:12,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:12,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809896674] [2023-12-24 21:29:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809896674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:12,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825480406] [2023-12-24 21:29:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:29:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:29:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:29:12,951 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:29:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:13,000 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2023-12-24 21:29:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:29:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-24 21:29:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:13,007 INFO L225 Difference]: With dead ends: 56 [2023-12-24 21:29:13,007 INFO L226 Difference]: Without dead ends: 26 [2023-12-24 21:29:13,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:29:13,013 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:13,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:29:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-24 21:29:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-24 21:29:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:29:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-12-24 21:29:13,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 13 [2023-12-24 21:29:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:13,043 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-12-24 21:29:13,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:29:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-12-24 21:29:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 21:29:13,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:13,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:13,048 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 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:13,248 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:29:13,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:13,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1000421595, now seen corresponding path program 1 times [2023-12-24 21:29:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:13,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602376663] [2023-12-24 21:29:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:13,249 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:29:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:13,251 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:29:13,264 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:29:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:13,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:29:13,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:13,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:13,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:13,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602376663] [2023-12-24 21:29:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602376663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:13,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:13,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717961618] [2023-12-24 21:29:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:13,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:13,393 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:29:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:13,453 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2023-12-24 21:29:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-24 21:29:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:13,454 INFO L225 Difference]: With dead ends: 51 [2023-12-24 21:29:13,454 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 21:29:13,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:29:13,456 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:13,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 21:29:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-12-24 21:29:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:29:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-12-24 21:29:13,463 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2023-12-24 21:29:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:13,463 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-12-24 21:29:13,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:29:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-12-24 21:29:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:29:13,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:13,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:13,473 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:29:13,670 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:29:13,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:13,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -538017187, now seen corresponding path program 1 times [2023-12-24 21:29:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292400083] [2023-12-24 21:29:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:13,673 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:29:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:13,674 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:29:13,680 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:29:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:13,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:29:13,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:13,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:13,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292400083] [2023-12-24 21:29:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292400083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:13,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:29:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802488621] [2023-12-24 21:29:13,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:13,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:13,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:13,855 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:29:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:13,918 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2023-12-24 21:29:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 21 [2023-12-24 21:29:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:13,919 INFO L225 Difference]: With dead ends: 56 [2023-12-24 21:29:13,919 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 21:29:13,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:29:13,920 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 21:29:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-12-24 21:29:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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:29:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-24 21:29:13,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 21 [2023-12-24 21:29:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:13,924 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-24 21:29:13,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:29:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-24 21:29:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:29:13,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:13,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:13,932 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 (4)] Ended with exit code 0 [2023-12-24 21:29:14,129 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:29:14,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:14,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1549134437, now seen corresponding path program 1 times [2023-12-24 21:29:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:14,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481682618] [2023-12-24 21:29:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:14,131 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:29:14,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:14,132 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:29:14,133 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:29:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:14,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:29:14,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:14,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:29:14,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481682618] [2023-12-24 21:29:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481682618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:14,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 21:29:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131450350] [2023-12-24 21:29:14,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:29:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:29:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:14,299 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-24 21:29:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:14,393 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2023-12-24 21:29:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:29:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-12-24 21:29:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:14,394 INFO L225 Difference]: With dead ends: 56 [2023-12-24 21:29:14,394 INFO L226 Difference]: Without dead ends: 36 [2023-12-24 21:29:14,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:14,395 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:14,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 89 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-24 21:29:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-12-24 21:29:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:29:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-24 21:29:14,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 21 [2023-12-24 21:29:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:14,401 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-24 21:29:14,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-24 21:29:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-24 21:29:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:29:14,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:14,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:14,410 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 (5)] Ended with exit code 0 [2023-12-24 21:29:14,606 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 [2023-12-24 21:29:14,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:14,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1972828883, now seen corresponding path program 1 times [2023-12-24 21:29:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246115668] [2023-12-24 21:29:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:14,607 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:29:14,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:14,609 INFO L229 MonitoredProcess]: Starting monitored process 6 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:29:14,610 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 (6)] Waiting until timeout for monitored process [2023-12-24 21:29:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:14,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 21:29:14,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:14,927 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:29:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:29:14,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:14,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246115668] [2023-12-24 21:29:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246115668] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:14,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-12-24 21:29:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687800162] [2023-12-24 21:29:14,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:14,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:29:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:29:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:29:14,983 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:29:18,997 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:29:23,033 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:29:27,165 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:29:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:27,783 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-12-24 21:29:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:29:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-12-24 21:29:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:27,787 INFO L225 Difference]: With dead ends: 60 [2023-12-24 21:29:27,787 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 21:29:27,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 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:29:27,788 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:27,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 202 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2023-12-24 21:29:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 21:29:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-24 21:29:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:29:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-12-24 21:29:27,798 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 29 [2023-12-24 21:29:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:27,798 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-12-24 21:29:27,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:29:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-12-24 21:29:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 21:29:27,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:27,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:27,816 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 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:28,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:29:28,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:28,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1432775987, now seen corresponding path program 1 times [2023-12-24 21:29:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:28,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372264676] [2023-12-24 21:29:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:28,009 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:29:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:28,010 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:29:28,011 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:29:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:28,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 21:29:28,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:28,265 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:29:28,394 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 11 treesize of output 5 [2023-12-24 21:29:28,510 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 21:29:28,511 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 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-24 21:29:28,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-24 21:29:28,801 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:29:28,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2023-12-24 21:29:28,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-12-24 21:29:28,884 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 24 treesize of output 12 [2023-12-24 21:29:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:29:28,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:29,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:29,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-24 21:29:29,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:29,021 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 59 treesize of output 58 [2023-12-24 21:29:29,036 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 34 treesize of output 26 [2023-12-24 21:29:31,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:31,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372264676] [2023-12-24 21:29:31,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372264676] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:31,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [275321639] [2023-12-24 21:29:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:31,871 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:29:31,885 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:29:31,910 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:29:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:32,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-24 21:29:32,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:32,198 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:29:32,406 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 11 treesize of output 5 [2023-12-24 21:29:32,579 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 21:29:32,579 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 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-24 21:29:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-24 21:29:32,968 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:29:32,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2023-12-24 21:29:33,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-12-24 21:29:33,076 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 24 treesize of output 12 [2023-12-24 21:29:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:29:33,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:33,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:33,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-24 21:29:33,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:33,117 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 59 treesize of output 58 [2023-12-24 21:29:33,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 34 treesize of output 26 [2023-12-24 21:29:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [275321639] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:37,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2023-12-24 21:29:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708460649] [2023-12-24 21:29:37,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:37,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 21:29:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:37,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 21:29:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 21:29:37,327 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 28 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-24 21:29:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:39,577 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2023-12-24 21:29:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 21:29:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2023-12-24 21:29:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:39,578 INFO L225 Difference]: With dead ends: 51 [2023-12-24 21:29:39,578 INFO L226 Difference]: Without dead ends: 48 [2023-12-24 21:29:39,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2023-12-24 21:29:39,579 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:39,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 356 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-24 21:29:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-24 21:29:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2023-12-24 21:29:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:29:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-12-24 21:29:39,584 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 32 [2023-12-24 21:29:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:39,584 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-12-24 21:29:39,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-24 21:29:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-12-24 21:29:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 21:29:39,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:39,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:39,593 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:29:39,794 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:29:39,991 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:29:39,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:39,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1811568273, now seen corresponding path program 1 times [2023-12-24 21:29:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445716921] [2023-12-24 21:29:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:39,992 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:29:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:39,993 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:29:39,995 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:29:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:40,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 21:29:40,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:40,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:29:40,333 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:40,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:40,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:40,457 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:40,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-24 21:29:40,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2023-12-24 21:29:40,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:40,668 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_append_~head#1.offset_BEFORE_CALL_5|) (_ bv0 32)))) is different from true [2023-12-24 21:29:40,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:40,683 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 52 treesize of output 35 [2023-12-24 21:29:40,719 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:40,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:40,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-12-24 21:29:40,816 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 24 treesize of output 12 [2023-12-24 21:29:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 21:29:40,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:41,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445716921] [2023-12-24 21:29:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445716921] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [801361508] [2023-12-24 21:29:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:29:41,129 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:29:41,130 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:29:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:41,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 21:29:41,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:41,421 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:29:41,659 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:41,660 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:29:41,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:29:41,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:29:42,175 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:29:42,180 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:29:42,427 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 21:29:42,428 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 24 treesize of output 26 [2023-12-24 21:29:42,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:29:42,917 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 39 treesize of output 15 [2023-12-24 21:29:42,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:29:43,027 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:29:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:43,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:43,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_624 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_624 .cse0))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_625) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-24 21:29:43,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= v_ArrVal_624 (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_624 .cse1))))) (= (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_625) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-12-24 21:29:43,449 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_624) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_625) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_624 (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_624 .cse1)))))))) is different from false [2023-12-24 21:29:43,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| (_ BitVec 32)) (v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= v_ArrVal_624 (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_630) .cse0) .cse1 (select v_ArrVal_624 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_624) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_625) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) (_ bv0 1)))))) is different from false [2023-12-24 21:29:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [801361508] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:43,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 41 [2023-12-24 21:29:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281166204] [2023-12-24 21:29:43,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:43,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-24 21:29:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-24 21:29:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1940, Unknown=19, NotChecked=460, Total=2550 [2023-12-24 21:29:43,521 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 41 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:29:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:48,412 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2023-12-24 21:29:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 21:29:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-24 21:29:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:48,414 INFO L225 Difference]: With dead ends: 49 [2023-12-24 21:29:48,414 INFO L226 Difference]: Without dead ends: 38 [2023-12-24 21:29:48,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=279, Invalid=3504, Unknown=19, NotChecked=620, Total=4422 [2023-12-24 21:29:48,416 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:48,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 535 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 705 Invalid, 0 Unknown, 44 Unchecked, 3.5s Time] [2023-12-24 21:29:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-24 21:29:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-24 21:29:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:29:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-12-24 21:29:48,422 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 34 [2023-12-24 21:29:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:48,422 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-12-24 21:29:48,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:29:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-12-24 21:29:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 21:29:48,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:48,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:48,432 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:29:48,633 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:29:48,829 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:29:48,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2042580622, now seen corresponding path program 1 times [2023-12-24 21:29:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684229311] [2023-12-24 21:29:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:48,831 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:29:48,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:48,832 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:29:48,838 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:29:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:49,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-24 21:29:49,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:49,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:29:49,201 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:49,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:49,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:49,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-24 21:29:49,465 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 44 treesize of output 20 [2023-12-24 21:29:49,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:49,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:49,608 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 52 treesize of output 35 [2023-12-24 21:29:49,627 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:49,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:50,056 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-12-24 21:29:50,056 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 48 [2023-12-24 21:29:50,079 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-12-24 21:29:50,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 76 [2023-12-24 21:29:50,188 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 88 treesize of output 56 [2023-12-24 21:29:50,192 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:29:50,192 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 56 treesize of output 23 [2023-12-24 21:29:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:50,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:50,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_29| (_ BitVec 32)) (v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_730))) (let ((.cse0 (select (select .cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (store |c_#memory_$Pointer$#1.base| .cse0 (store (select .cse1 .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_29| (_ bv4 32)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|)))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_727) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|))))) is different from false [2023-12-24 21:29:50,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684229311] [2023-12-24 21:29:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684229311] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721783140] [2023-12-24 21:29:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:29:50,949 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:29:50,951 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:29:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:51,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-24 21:29:51,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:51,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:29:51,503 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:29:51,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:29:51,680 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:51,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-24 21:29:51,943 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 44 treesize of output 20 [2023-12-24 21:29:51,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:52,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:29:52,189 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 52 treesize of output 35 [2023-12-24 21:29:52,210 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:52,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:52,884 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:29:52,884 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 2 case distinctions, treesize of input 70 treesize of output 37 [2023-12-24 21:29:52,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-12-24 21:29:52,979 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 24 treesize of output 12 [2023-12-24 21:29:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:52,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:53,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_829 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| (_ BitVec 32)) (v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_832) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_828) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| v_ArrVal_829) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 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 (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39|) (_ bv0 1))) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_39| (_ bv0 32)))) is different from false [2023-12-24 21:29:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [721783140] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:29:53,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 41 [2023-12-24 21:29:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344500322] [2023-12-24 21:29:53,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-24 21:29:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-24 21:29:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2214, Unknown=60, NotChecked=194, Total=2652 [2023-12-24 21:29:53,732 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 41 states, 35 states have (on average 1.4) internal successors, (49), 32 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:30:00,328 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:30:06,039 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:30:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:06,264 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2023-12-24 21:30:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 21:30:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.4) internal successors, (49), 32 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-24 21:30:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:06,265 INFO L225 Difference]: With dead ends: 54 [2023-12-24 21:30:06,266 INFO L226 Difference]: Without dead ends: 51 [2023-12-24 21:30:06,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=334, Invalid=3774, Unknown=60, NotChecked=254, Total=4422 [2023-12-24 21:30:06,267 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 87 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:06,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 480 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 847 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2023-12-24 21:30:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-24 21:30:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2023-12-24 21:30:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:30:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-24 21:30:06,273 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 34 [2023-12-24 21:30:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:06,274 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-24 21:30:06,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.4) internal successors, (49), 32 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:30:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-24 21:30:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:30:06,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:06,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:06,280 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:30:06,484 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:30:06,676 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:30:06,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:06,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash 95133706, now seen corresponding path program 1 times [2023-12-24 21:30:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010354916] [2023-12-24 21:30:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:06,678 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:30:06,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:06,679 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:30:06,714 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:30:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:06,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-24 21:30:06,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:06,940 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:30:07,071 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:07,072 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:30:07,113 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:30:07,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:30:07,171 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:07,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:30:07,177 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 24 treesize of output 11 [2023-12-24 21:30:07,343 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:30:07,347 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:30:07,350 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:30:07,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:07,493 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:30:07,511 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:07,511 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:30:07,536 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:30:07,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-12-24 21:30:07,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:30:08,038 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:30:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:08,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:08,373 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)) v_ArrVal_934) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_933) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-12-24 21:30:08,648 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| (_ BitVec 32)) (v_ArrVal_934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_933 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_941) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_934) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_933) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43|))))) is different from false [2023-12-24 21:30:08,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010354916] [2023-12-24 21:30:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010354916] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [441193711] [2023-12-24 21:30:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:08,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:08,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:30:08,652 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:30:08,653 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:30:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:09,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-24 21:30:09,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:09,091 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:30:09,421 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:09,421 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:30:09,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:30:09,524 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:30:09,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:09,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:30:09,632 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 24 treesize of output 11 [2023-12-24 21:30:09,989 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:30:09,994 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:30:09,998 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:30:14,357 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:30:14,357 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:30:14,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:14,372 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:30:14,401 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:14,401 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:30:15,059 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:30:15,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 48 [2023-12-24 21:30:15,065 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 58 treesize of output 26 [2023-12-24 21:30:15,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:30:15,170 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:30:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:15,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:15,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_1046) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1045) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:15,575 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_1046) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1045) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:15,636 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1054 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1054) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) v_ArrVal_1046) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_1045) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47|))))) is different from false [2023-12-24 21:30:15,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [441193711] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:15,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:15,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 45 [2023-12-24 21:30:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21338714] [2023-12-24 21:30:15,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:15,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-24 21:30:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:15,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-24 21:30:15,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2513, Unknown=64, NotChecked=530, Total=3306 [2023-12-24 21:30:15,640 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 45 states, 38 states have (on average 1.394736842105263) internal successors, (53), 35 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:30:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:19,677 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2023-12-24 21:30:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 21:30:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.394736842105263) internal successors, (53), 35 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-24 21:30:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:19,678 INFO L225 Difference]: With dead ends: 61 [2023-12-24 21:30:19,678 INFO L226 Difference]: Without dead ends: 59 [2023-12-24 21:30:19,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=311, Invalid=3676, Unknown=65, NotChecked=640, Total=4692 [2023-12-24 21:30:19,680 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:19,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 371 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-24 21:30:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-24 21:30:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2023-12-24 21:30:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:30:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-12-24 21:30:19,687 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 36 [2023-12-24 21:30:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:19,687 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-12-24 21:30:19,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.394736842105263) internal successors, (53), 35 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:30:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-12-24 21:30:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-24 21:30:19,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:19,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:19,692 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:30:19,898 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 (13)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:20,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /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:30:20,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:20,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1345876902, now seen corresponding path program 1 times [2023-12-24 21:30:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893730142] [2023-12-24 21:30:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:20,093 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:30:20,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:20,094 INFO L229 MonitoredProcess]: Starting monitored process 15 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:30:20,098 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 (15)] Waiting until timeout for monitored process [2023-12-24 21:30:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:20,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:30:20,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:20,312 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 31 treesize of output 19 [2023-12-24 21:30:20,314 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 25 treesize of output 13 [2023-12-24 21:30:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-24 21:30:20,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:30:20,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:20,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893730142] [2023-12-24 21:30:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893730142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:30:20,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:30:20,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:30:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720904019] [2023-12-24 21:30:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:30:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:30:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:30:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:30:20,327 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:30:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:20,579 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-12-24 21:30:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:30:20,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 37 [2023-12-24 21:30:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:20,580 INFO L225 Difference]: With dead ends: 55 [2023-12-24 21:30:20,580 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 21:30:20,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:30:20,581 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:20,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:30:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 21:30:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-12-24 21:30:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:30:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-12-24 21:30:20,592 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 37 [2023-12-24 21:30:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:20,592 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-12-24 21:30:20,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:30:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-12-24 21:30:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 21:30:20,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:20,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:20,600 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 (15)] Ended with exit code 0 [2023-12-24 21:30:20,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:30:20,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:20,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1515299867, now seen corresponding path program 2 times [2023-12-24 21:30:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095351656] [2023-12-24 21:30:20,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:20,799 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:30:20,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:20,800 INFO L229 MonitoredProcess]: Starting monitored process 16 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:30:20,802 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 (16)] Waiting until timeout for monitored process [2023-12-24 21:30:21,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:21,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:21,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-24 21:30:21,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:21,186 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:30:21,223 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:30:21,428 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:21,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:21,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:30:21,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:21,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-24 21:30:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:30:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:30:21,630 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:30:21,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 55 [2023-12-24 21:30:21,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:21,644 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 24 treesize of output 11 [2023-12-24 21:30:21,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:21,653 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 24 treesize of output 11 [2023-12-24 21:30:21,922 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-24 21:30:21,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-12-24 21:30:21,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:30:21,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:30:21,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:30:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:22,191 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:30:22,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 34 [2023-12-24 21:30:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:22,219 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:22,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:22,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:22,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:22,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:30:23,184 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-24 21:30:23,184 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2023-12-24 21:30:23,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:30:23,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:23,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:23,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-12-24 21:30:23,490 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:30:23,490 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:30:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:23,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:23,808 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1254) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:23,984 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)))) v_ArrVal_1255) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1254) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:24,210 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)))) v_ArrVal_1255) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1254) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:30:24,324 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| (_ BitVec 32)) (v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1265))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1266) .cse1) .cse2)))) v_ArrVal_1255) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51| v_ArrVal_1254) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_51|))))) is different from false [2023-12-24 21:30:24,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095351656] [2023-12-24 21:30:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095351656] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1656329867] [2023-12-24 21:30:24,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:30:24,329 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:30:24,330 INFO L229 MonitoredProcess]: Starting monitored process 17 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:30:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-24 21:30:24,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:30:24,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:30:24,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-24 21:30:24,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:24,908 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:30:24,993 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:30:25,308 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 21:30:25,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-24 21:30:25,343 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:25,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:30:25,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:30:25,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:30:25,531 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-24 21:30:25,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:30:25,706 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:30:25,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 55 [2023-12-24 21:30:25,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:25,714 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 24 treesize of output 11 [2023-12-24 21:30:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:25,729 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 24 treesize of output 11 [2023-12-24 21:30:26,242 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-24 21:30:26,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-12-24 21:30:26,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:30:26,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:30:26,262 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:30:26,924 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:30:26,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-24 21:30:26,945 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:30:26,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2023-12-24 21:30:26,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:26,977 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-24 21:30:26,978 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 39 [2023-12-24 21:30:26,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:27,005 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:27,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:28,448 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-24 21:30:28,448 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 22 [2023-12-24 21:30:28,461 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-24 21:30:28,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 21:30:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:28,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-24 21:30:28,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:28,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2023-12-24 21:30:28,799 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:30:28,800 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:30:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:28,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1656329867] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:43,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:43,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 48 [2023-12-24 21:30:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571637038] [2023-12-24 21:30:43,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:43,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-24 21:30:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:43,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-24 21:30:43,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3277, Unknown=36, NotChecked=476, Total=4032 [2023-12-24 21:30:43,038 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 38 states have internal predecessors, (55), 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:30:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:52,298 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2023-12-24 21:30:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 21:30:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 38 states have internal predecessors, (55), 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 38 [2023-12-24 21:30:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:52,300 INFO L225 Difference]: With dead ends: 91 [2023-12-24 21:30:52,300 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 21:30:52,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=403, Invalid=4979, Unknown=36, NotChecked=588, Total=6006 [2023-12-24 21:30:52,302 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 81 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:52,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 367 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-24 21:30:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 21:30:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2023-12-24 21:30:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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:30:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-12-24 21:30:52,316 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 38 [2023-12-24 21:30:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:52,316 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-12-24 21:30:52,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 38 states have internal predecessors, (55), 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:30:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-12-24 21:30:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 21:30:52,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:52,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:52,323 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 (16)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:52,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:52,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:52,722 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:52,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash -549522398, now seen corresponding path program 1 times [2023-12-24 21:30:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618322532] [2023-12-24 21:30:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:52,723 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:30:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:52,723 INFO L229 MonitoredProcess]: Starting monitored process 18 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:30:52,724 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 (18)] Waiting until timeout for monitored process [2023-12-24 21:30:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:53,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-24 21:30:53,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:53,034 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:30:53,076 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 18 treesize of output 7 [2023-12-24 21:30:53,229 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:53,229 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:30:53,248 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:30:53,291 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:30:53,296 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:30:53,304 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:30:53,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:53,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2023-12-24 21:30:53,402 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 39 treesize of output 15 [2023-12-24 21:30:53,408 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 24 treesize of output 11 [2023-12-24 21:30:53,619 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 47 treesize of output 23 [2023-12-24 21:30:53,624 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:30:53,645 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:30:53,649 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:30:53,814 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:30:53,815 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:30:53,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:53,833 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 55 treesize of output 38 [2023-12-24 21:30:53,865 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-24 21:30:53,866 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:30:53,898 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:53,898 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:30:54,481 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:30:54,482 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 89 [2023-12-24 21:30:54,510 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:30:54,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 252 treesize of output 133 [2023-12-24 21:30:54,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 107 treesize of output 34 [2023-12-24 21:30:54,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 34 treesize of output 19 [2023-12-24 21:30:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:54,536 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 65 treesize of output 15 [2023-12-24 21:30:54,637 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 78 treesize of output 50 [2023-12-24 21:30:54,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:30:54,794 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 47 treesize of output 26 [2023-12-24 21:30:54,800 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:30:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:54,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:55,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1507 .cse0)) v_ArrVal_1507)) (= (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 (bvadd (_ bv4 32) (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 |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1507) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1508) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1509) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1504) .cse1) .cse2))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-12-24 21:30:55,263 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)))) (or (= (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1507) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1508) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1509) .cse2) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1505) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1504) .cse2) .cse3))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1507 .cse1)) v_ArrVal_1507)))))) is different from false [2023-12-24 21:30:55,350 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)))) (or (= (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1507) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1508) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1509) .cse2) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1505) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1504) .cse2) .cse3))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1507 .cse1)) v_ArrVal_1507)))))) is different from false [2023-12-24 21:30:55,398 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1507) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1508) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1509) .cse2) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1505) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1504) .cse2) .cse3)))) (not (= (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1507 .cse1)) v_ArrVal_1507)))))) is different from false [2023-12-24 21:30:55,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1518 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| (_ BitVec 32)) (v_ArrVal_1520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1520)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse1 (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1519) .cse5) .cse6) (_ bv4 32))) (.cse0 (select (select .cse2 .cse5) .cse6))) (or (not (= v_ArrVal_1507 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1518) .cse0) .cse1 (select v_ArrVal_1507 .cse1)))) (= (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1507) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1508) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select .cse2 .cse0) .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1509) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1505) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59| v_ArrVal_1504) .cse3) .cse4))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_59|))))))) is different from false [2023-12-24 21:30:55,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618322532] [2023-12-24 21:30:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618322532] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:30:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1725289722] [2023-12-24 21:30:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:55,565 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:30:55,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:30:55,566 INFO L229 MonitoredProcess]: Starting monitored process 19 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:30:55,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-24 21:30:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:56,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-24 21:30:56,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:56,088 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:30:56,165 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 18 treesize of output 7 [2023-12-24 21:30:56,362 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:56,362 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:30:56,373 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:30:56,475 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:30:56,500 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:30:56,509 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:30:56,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:56,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2023-12-24 21:30:56,642 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 39 treesize of output 15 [2023-12-24 21:30:56,651 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 24 treesize of output 11 [2023-12-24 21:30:56,993 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 47 treesize of output 23 [2023-12-24 21:30:56,999 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:30:57,003 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:30:57,010 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:31:01,360 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:31:01,361 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:31:01,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:01,381 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 55 treesize of output 38 [2023-12-24 21:31:01,405 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-24 21:31:01,406 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:31:01,447 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:31:01,447 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:31:02,293 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-24 21:31:02,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 94 [2023-12-24 21:31:02,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2023-12-24 21:31:02,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 34 [2023-12-24 21:31:02,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-12-24 21:31:02,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2023-12-24 21:31:02,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 21:31:02,589 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:31:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:31:02,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:31:02,650 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (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|)) (.cse1 (bvadd (_ bv4 32) (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 |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1637) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1636) .cse0) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1634) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1632) .cse0) .cse1)))) (not (= v_ArrVal_1635 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse2 (select v_ArrVal_1635 .cse2))))))) is different from false [2023-12-24 21:31:02,715 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4))) (or (= (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 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1637) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1633) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1636) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1634) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1632) .cse1) .cse2))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (let ((.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)))) (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_1635 .cse3))) v_ArrVal_1635)))))) is different from false [2023-12-24 21:31:02,772 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (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 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1637) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1633) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1636) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1634) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1632) .cse1) .cse2)))) (not (= (let ((.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)))) (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_1635 .cse3))) v_ArrVal_1635)))))) is different from false [2023-12-24 21:31:02,803 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (not (= (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1635 .cse1))) v_ArrVal_1635)) (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1637) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1633) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1636) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1634) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1632) .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-12-24 21:31:02,944 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| (_ BitVec 32)) (v_ArrVal_1632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1648) .cse2) .cse3))) (or (not (= (let ((.cse1 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1647) .cse2) .cse3)))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1646) .cse0) .cse1 (select v_ArrVal_1635 .cse1))) v_ArrVal_1635)) (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (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 |c_#memory_int#1| .cse0 v_ArrVal_1635) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1637) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1633) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1636) .cse4) .cse5)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1634) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63| v_ArrVal_1632) .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_63|))))))) is different from false [2023-12-24 21:31:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1725289722] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:31:02,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:31:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 45 [2023-12-24 21:31:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103704782] [2023-12-24 21:31:02,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:31:02,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-24 21:31:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:31:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-24 21:31:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2212, Unknown=11, NotChecked=1030, Total=3422 [2023-12-24 21:31:02,958 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 45 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 35 states have internal predecessors, (58), 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:31:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:31:08,340 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2023-12-24 21:31:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 21:31:08,340 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-12-24 21:31:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:31:08,341 INFO L225 Difference]: With dead ends: 89 [2023-12-24 21:31:08,341 INFO L226 Difference]: Without dead ends: 87 [2023-12-24 21:31:08,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=316, Invalid=4003, Unknown=11, NotChecked=1370, Total=5700 [2023-12-24 21:31:08,342 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:31:08,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 435 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-24 21:31:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-24 21:31:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2023-12-24 21:31:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 21:31:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-12-24 21:31:08,356 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 39 [2023-12-24 21:31:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:31:08,356 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-12-24 21:31:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 35 states have internal predecessors, (58), 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:31:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-12-24 21:31:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-24 21:31:08,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:31:08,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:31:08,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-12-24 21:31:08,570 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 (18)] Forceful destruction successful, exit code 0 [2023-12-24 21:31:08,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /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:31:08,763 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:31:08,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:31:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 144620354, now seen corresponding path program 1 times [2023-12-24 21:31:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:31:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165154477] [2023-12-24 21:31:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:31:08,763 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:31:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:31:08,764 INFO L229 MonitoredProcess]: Starting monitored process 20 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:31:08,767 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 (20)] Waiting until timeout for monitored process [2023-12-24 21:31:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:31:09,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-24 21:31:09,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:31:09,047 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:31:09,171 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:31:09,172 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:31:09,200 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:31:09,205 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:31:09,254 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:31:09,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:31:09,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 24 treesize of output 11 [2023-12-24 21:31:09,392 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:31:09,396 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:31:09,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-24 21:31:09,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:09,520 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 40 treesize of output 29 [2023-12-24 21:31:09,539 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:31:09,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:31:09,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:31:10,025 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:31:10,026 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 55 [2023-12-24 21:31:10,050 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:31:10,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 89 [2023-12-24 21:31:10,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:10,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 15 [2023-12-24 21:31:10,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 51 [2023-12-24 21:31:10,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:31:10,343 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:31:10,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-12-24 21:31:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:31:10,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:31:10,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (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 (bvadd (_ bv4 32) (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 ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1750))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1749) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1752) .cse1) .cse2)))) (_ bv0 32)))) is different from false [2023-12-24 21:31:10,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (.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 (bvadd (_ bv4 32) (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 ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1750))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1749) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1752) .cse1) .cse2))))) (_ bv0 32)))) is different from false [2023-12-24 21:31:10,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.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 (bvadd (_ bv4 32) (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 ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1750))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1749) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1752) .cse1) .cse2) (_ bv4 32))))) (_ bv0 32)))) is different from false [2023-12-24 21:31:10,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.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 (bvadd (_ bv4 32) (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 ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1750))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1749) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1752) .cse1) .cse2))))) (_ bv0 32)))) is different from false [2023-12-24 21:31:10,761 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1757 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (_ BitVec 32)) (v_ArrVal_1758 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|))) (not (= (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1758)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse3 (select (select .cse4 .cse5) .cse6)) (.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 (bvadd (_ bv4 32) (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 ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select .cse4 .cse3) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1757) .cse5) .cse6)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1750))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1749) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_1752) .cse1) .cse2))))) (_ bv0 32))))) is different from false [2023-12-24 21:31:10,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:31:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165154477] [2023-12-24 21:31:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165154477] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:31:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [518014265] [2023-12-24 21:31:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:31:10,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:31:10,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:31:10,766 INFO L229 MonitoredProcess]: Starting monitored process 21 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:31:10,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-24 21:31:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:31:11,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 21:31:11,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:31:11,240 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:31:11,489 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:31:11,489 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:31:11,570 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:31:11,653 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:31:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-24 21:31:11,921 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:31:11,924 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:31:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:31:16,176 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 40 treesize of output 29 [2023-12-24 21:31:16,199 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:31:16,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:31:16,881 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2023-12-24 21:31:16,882 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 65 [2023-12-24 21:31:16,905 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-12-24 21:31:16,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 159 [2023-12-24 21:31:16,921 INFO L349 Elim1Store]: treesize reduction 89, result has 9.2 percent of original size [2023-12-24 21:31:16,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 124 [2023-12-24 21:31:18,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 114 treesize of output 70 [2023-12-24 21:31:18,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-24 21:31:18,682 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:31:18,682 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 68 treesize of output 23 [2023-12-24 21:31:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:31:18,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:31:18,718 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (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 (bvadd (_ bv4 32) (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 ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1856) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1858) .cse1) .cse2)))) (_ bv0 32)))) is different from false [2023-12-24 21:31:18,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:31:18,768 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 938 treesize of output 834 [2023-12-24 21:31:18,775 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 398 treesize of output 390 [2023-12-24 21:31:18,779 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 390 treesize of output 374 [2023-12-24 21:31:18,969 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|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= .cse1 .cse3)) (.cse9 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (let ((.cse12 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (bvadd (_ bv4 32) .cse11)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse10 (and (or .cse12 (let ((.cse15 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (not (= (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 (bvadd v_arrayElimCell_265 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse16 (select (select .cse16 .cse1) .cse2))) (bvadd v_arrayElimCell_267 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse15 .cse5) (or .cse15 .cse8)))) (or (and (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (not (= (select (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 (bvadd v_arrayElimCell_265 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse17 (select (select .cse17 .cse1) .cse2))) (bvadd v_arrayElimCell_266 (_ bv4 32))) (_ bv0 32)))) .cse5) (or (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (select (let ((.cse18 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 (bvadd v_arrayElimCell_265 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse18 (select (select .cse18 .cse1) .cse2))) (bvadd v_arrayElimCell_264 (_ bv4 32))) (_ bv0 32)))) .cse8)) .cse9)))) (and (or (and (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 (bvadd v_arrayElimCell_264 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd v_arrayElimCell_266 (_ bv4 32))) (_ bv0 32)))) .cse5) (or (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (let ((.cse7 (bvadd v_arrayElimCell_264 (_ bv4 32)))) (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse6 (select (select .cse6 .cse1) .cse2))) .cse7)) (_ bv0 32)))) .cse8)) .cse9) (or (= .cse1 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (or (= .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) .cse10) (or .cse12 (let ((.cse13 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (select (let ((.cse14 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 (bvadd v_arrayElimCell_264 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse14 (select (select .cse14 .cse1) .cse2))) (bvadd v_arrayElimCell_267 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse13 .cse5) (or .cse13 .cse8))))))))) is different from false [2023-12-24 21:31:23,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse4) (bvadd (_ bv4 32) .cse1)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (= .cse3 .cse7)) (.cse13 (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (let ((.cse16 (not .cse13)) (.cse9 (not .cse10)) (.cse6 (bvadd (_ bv4 32) .cse0)) (.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse2 (and (or .cse16 (let ((.cse17 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (not (= (select (let ((.cse18 (store (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse8 (bvadd v_arrayElimCell_265 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse18 (select (select .cse18 .cse3) .cse6))) (bvadd v_arrayElimCell_267 (_ bv4 32))) (_ bv0 32)))))) (and (or .cse17 .cse10) (or .cse9 .cse17)))) (or (and (or .cse9 (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (not (= (select (let ((.cse19 (store (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse8 (bvadd v_arrayElimCell_265 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse19 (select (select .cse19 .cse3) .cse6))) (bvadd v_arrayElimCell_266 (_ bv4 32))) (_ bv0 32))))) (or (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (select (let ((.cse20 (store (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse8 (bvadd v_arrayElimCell_265 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse20 (select (select .cse20 .cse3) .cse6))) (bvadd v_arrayElimCell_264 (_ bv4 32))) (_ bv0 32)))) .cse10)) .cse13)))) (and (or (= .cse0 .cse1) .cse2) (or (= .cse3 .cse4) .cse2) (or (and (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse8 (bvadd v_arrayElimCell_264 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse5 (select (select .cse5 .cse3) .cse6))) (bvadd v_arrayElimCell_266 (_ bv4 32))) (_ bv0 32)))) .cse9) (or .cse10 (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (let ((.cse12 (bvadd v_arrayElimCell_264 (_ bv4 32)))) (select (let ((.cse11 (store (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse8 .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse11 (select (select .cse11 .cse3) .cse6))) .cse12)) (_ bv0 32)))))) .cse13) (or (let ((.cse14 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (not (= (_ bv0 32) (select (let ((.cse15 (store (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse8 (bvadd v_arrayElimCell_264 (_ bv4 32)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1857))) (select .cse15 (select (select .cse15 .cse3) .cse6))) (bvadd v_arrayElimCell_267 (_ bv4 32)))))))) (and (or .cse14 .cse10) (or .cse14 .cse9))) .cse16))))))) is different from false [2023-12-24 21:32:55,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [518014265] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:32:55,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:32:55,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2023-12-24 21:32:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860656399] [2023-12-24 21:32:55,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:32:55,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-24 21:32:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:32:55,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-24 21:32:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2466, Unknown=51, NotChecked=856, Total=3540 [2023-12-24 21:32:55,700 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 47 states, 40 states have (on average 1.55) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:33:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:33:25,486 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2023-12-24 21:33:25,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 21:33:25,486 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 1.55) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2023-12-24 21:33:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:33:25,487 INFO L225 Difference]: With dead ends: 87 [2023-12-24 21:33:25,487 INFO L226 Difference]: Without dead ends: 82 [2023-12-24 21:33:25,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 128.8s TimeCoverageRelationStatistics Valid=350, Invalid=4739, Unknown=55, NotChecked=1176, Total=6320 [2023-12-24 21:33:25,488 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:33:25,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 790 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-24 21:33:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-24 21:33:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2023-12-24 21:33:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 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:33:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-12-24 21:33:25,501 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 40 [2023-12-24 21:33:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:33:25,501 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-12-24 21:33:25,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 1.55) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 21:33:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-12-24 21:33:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-24 21:33:25,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:33:25,502 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:33:25,508 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 (20)] Forceful destruction successful, exit code 0 [2023-12-24 21:33:25,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-12-24 21:33:25,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:33:25,903 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:33:25,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:33:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1341230336, now seen corresponding path program 3 times [2023-12-24 21:33:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:33:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053630741] [2023-12-24 21:33:25,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:33:25,904 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:33:25,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:33:25,905 INFO L229 MonitoredProcess]: Starting monitored process 22 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:33:25,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 21:33:26,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 21:33:26,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:33:26,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-24 21:33:26,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:33:26,690 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:33:26,721 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:33:26,726 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:33:26,919 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 21:33:26,920 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:33:26,947 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:33:26,947 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:33:26,959 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:33:27,008 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 17 treesize of output 19 [2023-12-24 21:33:27,015 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 7 [2023-12-24 21:33:27,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-24 21:33:27,031 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:33:27,098 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:33:27,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 61 [2023-12-24 21:33:27,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-24 21:33:27,378 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:33:27,378 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 77 treesize of output 36 [2023-12-24 21:33:27,384 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 26 treesize of output 10 [2023-12-24 21:33:27,388 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:33:35,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:33:35,587 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:33:35,587 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 85 treesize of output 62 [2023-12-24 21:33:35,627 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-24 21:33:35,627 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 50 treesize of output 58 [2023-12-24 21:33:35,670 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:33:35,670 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:33:36,245 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:33:36,246 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 62 treesize of output 29 [2023-12-24 21:33:36,250 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 26 treesize of output 10 [2023-12-24 21:33:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:33:36,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:33:37,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:33:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053630741] [2023-12-24 21:33:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053630741] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:33:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398314579] [2023-12-24 21:33:37,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:33:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:33:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:33:37,385 INFO L229 MonitoredProcess]: Starting monitored process 23 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:33:37,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-24 21:33:38,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 21:33:38,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:33:38,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-24 21:33:38,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:33:38,206 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:33:38,299 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:33:38,310 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:33:38,712 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:33:38,712 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:33:38,734 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:33:38,741 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:33:38,859 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-24 21:33:38,868 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:33:38,880 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 17 treesize of output 19 [2023-12-24 21:33:38,888 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 7 [2023-12-24 21:33:38,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:33:39,049 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:33:39,049 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 1 case distinctions, treesize of input 104 treesize of output 69 [2023-12-24 21:33:39,058 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 24 treesize of output 11 [2023-12-24 21:33:39,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-24 21:33:39,660 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:33:39,660 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 77 treesize of output 36 [2023-12-24 21:33:39,668 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 26 treesize of output 10 [2023-12-24 21:33:39,675 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:33:39,679 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:33:40,062 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:33:40,063 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:33:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:33:40,114 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 21:33:40,114 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 85 treesize of output 62 [2023-12-24 21:33:40,176 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-24 21:33:40,176 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 50 treesize of output 58 [2023-12-24 21:33:40,238 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:33:40,238 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:33:41,339 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:33:41,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2023-12-24 21:33:41,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-12-24 21:33:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:33:41,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:33:41,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.base| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2087) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-24 21:33:43,585 WARN L854 $PredicateComparison]: unable to prove that (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|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_90| (_ BitVec 32)) (v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79|) (_ bv0 1))) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_90| v_ArrVal_2088) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_2087) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_ArrVal_2098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2099 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_2099))) (select .cse2 (select (select .cse2 .cse3) .cse4))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_2098) .cse3) .cse4))))))) (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_90| (_ BitVec 32)) (v_ArrVal_2087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79|) (_ bv0 1))) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_90| v_ArrVal_2088) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_2087) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_ArrVal_2098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2099 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_2098))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_2099) .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4)))))))))) is different from false [2023-12-24 21:33:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [398314579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:33:43,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:33:43,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2023-12-24 21:33:43,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170980380] [2023-12-24 21:33:43,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:33:43,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-24 21:33:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:33:43,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-24 21:33:43,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2770, Unknown=14, NotChecked=214, Total=3192 [2023-12-24 21:33:43,594 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 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:33:47,668 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:33:52,249 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:34:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:34:01,578 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2023-12-24 21:34:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 21:34:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 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 40 [2023-12-24 21:34:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:34:01,579 INFO L225 Difference]: With dead ends: 92 [2023-12-24 21:34:01,579 INFO L226 Difference]: Without dead ends: 69 [2023-12-24 21:34:01,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=328, Invalid=4221, Unknown=15, NotChecked=266, Total=4830 [2023-12-24 21:34:01,580 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:34:01,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 395 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 812 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2023-12-24 21:34:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-24 21:34:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-12-24 21:34:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 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:34:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2023-12-24 21:34:01,592 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 40 [2023-12-24 21:34:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:34:01,593 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2023-12-24 21:34:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 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:34:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2023-12-24 21:34:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 21:34:01,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:34:01,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:34:01,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-24 21:34:01,802 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 (22)] Ended with exit code 0 [2023-12-24 21:34:01,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /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:34:01,994 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:34:01,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:34:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1594231050, now seen corresponding path program 2 times [2023-12-24 21:34:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:34:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253060919] [2023-12-24 21:34:01,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:34:01,995 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:34:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:34:01,996 INFO L229 MonitoredProcess]: Starting monitored process 24 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:34:01,997 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 (24)] Waiting until timeout for monitored process [2023-12-24 21:34:02,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:34:02,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:34:02,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 80 conjunts are in the unsatisfiable core [2023-12-24 21:34:02,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:34:02,346 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:34:02,480 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:34:02,481 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:34:02,519 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:34:02,524 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:34:02,579 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:34:02,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:34:02,587 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 24 treesize of output 11 [2023-12-24 21:34:02,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-24 21:34:02,760 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:34:02,765 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:34:03,061 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:34:03,062 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 1 case distinctions, treesize of input 37 treesize of output 22 [2023-12-24 21:34:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:34:03,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2023-12-24 21:34:03,121 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:34:03,121 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:34:03,862 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-12-24 21:34:03,862 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 297 treesize of output 124 [2023-12-24 21:34:03,874 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 86 treesize of output 59 [2023-12-24 21:34:04,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2023-12-24 21:34:04,901 INFO L349 Elim1Store]: treesize reduction 98, result has 10.1 percent of original size [2023-12-24 21:34:04,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 149 treesize of output 83 [2023-12-24 21:34:04,909 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 36 treesize of output 16 [2023-12-24 21:34:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:34:04,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:35:18,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:35:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253060919] [2023-12-24 21:35:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253060919] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:35:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551158821] [2023-12-24 21:35:18,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:35:18,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:35:18,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:35:18,143 INFO L229 MonitoredProcess]: Starting monitored process 25 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:35:18,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-24 21:35:18,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:35:18,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:35:18,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 94 conjunts are in the unsatisfiable core [2023-12-24 21:35:18,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:35:19,120 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:35:21,690 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:35:21,690 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:35:22,815 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:35:22,824 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:35:23,701 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:35:23,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:35:23,711 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 24 treesize of output 11 [2023-12-24 21:35:25,567 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:35:25,573 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:35:25,578 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:35:27,595 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:35:30,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:35:30,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2023-12-24 21:35:30,159 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:35:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:35:30,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2023-12-24 21:35:32,555 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-12-24 21:35:32,555 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 407 treesize of output 178 [2023-12-24 21:35:32,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:35:32,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 63 [2023-12-24 21:35:32,587 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 28 treesize of output 1 [2023-12-24 21:35:32,596 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 42 treesize of output 23 [2023-12-24 21:35:32,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:35:32,620 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 114 treesize of output 71 [2023-12-24 21:35:33,426 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 181 treesize of output 129 [2023-12-24 21:35:36,360 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 23 treesize of output 7 [2023-12-24 21:35:37,368 INFO L349 Elim1Store]: treesize reduction 98, result has 10.1 percent of original size [2023-12-24 21:35:37,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 149 treesize of output 83 [2023-12-24 21:35:37,378 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 36 treesize of output 16 [2023-12-24 21:35:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:35:37,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:36:21,231 INFO L349 Elim1Store]: treesize reduction 911, result has 50.3 percent of original size [2023-12-24 21:36:21,232 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 2790 treesize of output 3244 [2023-12-24 21:36:21,757 INFO L224 Elim1Store]: Index analysis took 186 ms [2023-12-24 21:36:24,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:36:24,123 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 4594 treesize of output 4916 [2023-12-24 21:36:26,731 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 286 treesize of output 4 [2023-12-24 21:36:29,946 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 920 treesize of output 638 [2023-12-24 21:36:30,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:36:30,813 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 10439 treesize of output 9033 [2023-12-24 21:36:41,053 WARN L876 $PredicateComparison]: unable to prove that (let ((.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 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (or (not (= (bvadd (_ bv4 32) (select (select .cse0 .cse1) .cse2)) (_ bv0 32))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse9 (select (select .cse12 .cse1) .cse2))) (let ((.cse4 (let ((.cse11 (store (select .cse12 .cse9) (_ bv0 32) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse9 .cse11) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse12 .cse9 .cse11) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse9))))) (let ((.cse5 (select (select .cse4 .cse7) .cse8))) (or (= (let ((.cse3 (let ((.cse10 (store (select .cse0 .cse9) (_ bv0 32) (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse9 .cse10) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse0 .cse9 .cse10) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) (_ bv4294967292 32)))))) (let ((.cse6 (bvadd (select (select .cse3 .cse7) .cse8) (_ bv4 32)))) (select (select .cse3 (select (select .cse4 .cse5) .cse6)) (bvadd (_ bv4 32) (select (select .cse3 .cse5) .cse6))))) (_ bv0 32)) (not (= .cse5 .cse9))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|)) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (let ((.cse23 (select (select .cse22 .cse1) .cse2)) (.cse19 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse17 (select (select .cse19 .cse1) .cse2)) (.cse20 (bvadd (_ bv4 32) .cse23))) (let ((.cse13 (let ((.cse21 (store (select .cse22 .cse17) .cse20 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse17 .cse21) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse22 .cse17 .cse21) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse23)))) (.cse14 (let ((.cse18 (store (select .cse19 .cse17) .cse20 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse17 .cse18) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse19 .cse17 .cse18) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse17))))) (let ((.cse15 (select (select .cse14 .cse7) .cse8)) (.cse16 (bvadd (_ bv4 32) (select (select .cse13 .cse7) .cse8)))) (select (select .cse13 (select (select .cse14 .cse15) .cse16)) (bvadd (_ bv4 32) (select (select .cse13 .cse15) .cse16)))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (= (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (let ((.cse34 (select (select .cse33 .cse1) .cse2)) (.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse28 (select (select .cse30 .cse1) .cse2)) (.cse31 (bvadd (_ bv4 32) .cse34))) (let ((.cse27 (let ((.cse32 (store (select .cse33 .cse28) .cse31 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse28 .cse32) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse33 .cse28 .cse32) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse34)))) (.cse24 (let ((.cse29 (store (select .cse30 .cse28) .cse31 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse28 .cse29) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse30 .cse28 .cse29) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse28))))) (let ((.cse25 (select (select .cse24 .cse7) .cse8)) (.cse26 (bvadd (_ bv4 32) (select (select .cse27 .cse7) .cse8)))) (select (select .cse24 (select (select .cse24 .cse25) .cse26)) (bvadd (_ bv4 32) (select (select .cse27 .cse25) .cse26)))))))) (_ bv0 32))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse45 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (let ((.cse46 (select (select .cse45 .cse1) .cse2)) (.cse42 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse40 (select (select .cse42 .cse1) .cse2)) (.cse43 (bvadd (_ bv4 32) .cse46))) (let ((.cse39 (let ((.cse44 (store (select .cse45 .cse40) .cse43 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse40 .cse44) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse45 .cse40 .cse44) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse46))))) (let ((.cse35 (select (select .cse39 .cse7) .cse8))) (or (= .cse35 (_ bv0 32)) (= (let ((.cse36 (let ((.cse41 (store (select .cse42 .cse40) .cse43 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse40 .cse41) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse42 .cse40 .cse41) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse40))))) (let ((.cse37 (select (select .cse36 .cse7) .cse8)) (.cse38 (bvadd (_ bv4 32) .cse35))) (select (select .cse36 (select (select .cse36 .cse37) .cse38)) (bvadd (_ bv4 32) (select (select .cse39 .cse37) .cse38))))) (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse57 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (let ((.cse58 (select (select .cse57 .cse1) .cse2)) (.cse54 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse52 (select (select .cse54 .cse1) .cse2)) (.cse55 (bvadd (_ bv4 32) .cse58))) (let ((.cse47 (let ((.cse56 (store (select .cse57 .cse52) .cse55 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse52 .cse56) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse57 .cse52 .cse56) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse58))))) (let ((.cse51 (select (select .cse47 .cse7) .cse8))) (or (= (_ bv0 32) (let ((.cse48 (let ((.cse53 (store (select .cse54 .cse52) .cse55 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse52 .cse53) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse54 .cse52 .cse53) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse52))))) (let ((.cse49 (select (select .cse48 .cse7) .cse8)) (.cse50 (bvadd (_ bv4 32) .cse51))) (select (select .cse47 (select (select .cse48 .cse49) .cse50)) (bvadd (_ bv4 32) (select (select .cse47 .cse49) .cse50)))))) (= .cse51 (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse65 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (let ((.cse66 (select (select .cse65 .cse1) .cse2)) (.cse69 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse63 (select (select .cse69 .cse1) .cse2)) (.cse67 (bvadd (_ bv4 32) .cse66))) (let ((.cse61 (let ((.cse68 (store (select .cse69 .cse63) .cse67 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse63 .cse68) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse69 .cse63 .cse68) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse63))))) (let ((.cse59 (select (select .cse61 .cse7) .cse8))) (or (= .cse59 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (= (_ bv0 32) (let ((.cse60 (let ((.cse64 (store (select .cse65 .cse63) .cse67 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse63 .cse64) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse65 .cse63 .cse64) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse66))))) (let ((.cse62 (bvadd (_ bv4 32) (select (select .cse60 .cse7) .cse8)))) (select (select .cse60 (select (select .cse61 .cse59) .cse62)) (bvadd (_ bv4 32) (select (select .cse60 .cse59) .cse62))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse76 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (let ((.cse77 (select (select .cse76 .cse1) .cse2)) (.cse80 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse74 (select (select .cse80 .cse1) .cse2)) (.cse78 (bvadd (_ bv4 32) .cse77))) (let ((.cse71 (let ((.cse79 (store (select .cse80 .cse74) .cse78 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse74 .cse79) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse80 .cse74 .cse79) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse74))))) (let ((.cse70 (select (select .cse71 .cse7) .cse8))) (or (= .cse70 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (= (let ((.cse73 (let ((.cse75 (store (select .cse76 .cse74) .cse78 (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse74 .cse75) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse76 .cse74 .cse75) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse77))))) (let ((.cse72 (bvadd (_ bv4 32) (select (select .cse73 .cse7) .cse8)))) (select (select .cse71 (select (select .cse71 .cse70) .cse72)) (bvadd (_ bv4 32) (select (select .cse73 .cse70) .cse72))))) (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse81 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_11) (_ bv0 32) v_DerPreprocessor_12)))) (or (not (= (bvadd (_ bv4 32) (select (select .cse81 .cse1) .cse2)) (_ bv0 32))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse89 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_9) (_ bv0 32) v_DerPreprocessor_10)))) (let ((.cse86 (select (select .cse89 .cse1) .cse2))) (let ((.cse82 (let ((.cse88 (store (select .cse89 .cse86) (_ bv0 32) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|))) (store (store |c_#memory_$Pointer$#1.base| .cse86 .cse88) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse89 .cse86 .cse88) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) .cse86))))) (let ((.cse83 (select (select .cse82 .cse7) .cse8))) (or (= (let ((.cse85 (let ((.cse87 (store (select .cse81 .cse86) (_ bv0 32) (_ bv0 32)))) (store (store |c_#memory_$Pointer$#1.offset| .cse86 .cse87) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87| (store (select (store .cse81 .cse86 .cse87) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv8 32) (_ bv4294967292 32)))))) (let ((.cse84 (bvadd (select (select .cse85 .cse7) .cse8) (_ bv4 32)))) (select (select .cse82 (select (select .cse82 .cse83) .cse84)) (bvadd (_ bv4 32) (select (select .cse85 .cse83) .cse84))))) (_ bv0 32)) (not (= .cse83 .cse86))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_87|) (_ bv0 1))))))) is different from true [2023-12-24 21:36:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [551158821] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:36:41,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:36:41,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 47 [2023-12-24 21:36:41,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720446725] [2023-12-24 21:36:41,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:36:41,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-24 21:36:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:36:41,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-24 21:36:41,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3792, Unknown=16, NotChecked=124, Total=4160 [2023-12-24 21:36:41,057 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 47 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 38 states have internal predecessors, (64), 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:37:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:37:04,961 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2023-12-24 21:37:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 21:37:04,961 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 38 states have internal predecessors, (64), 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 42 [2023-12-24 21:37:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:37:04,962 INFO L225 Difference]: With dead ends: 81 [2023-12-24 21:37:04,962 INFO L226 Difference]: Without dead ends: 73 [2023-12-24 21:37:04,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 147.6s TimeCoverageRelationStatistics Valid=371, Invalid=5469, Unknown=16, NotChecked=150, Total=6006 [2023-12-24 21:37:04,963 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 93 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:37:04,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 405 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-12-24 21:37:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-24 21:37:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2023-12-24 21:37:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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:37:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-12-24 21:37:04,977 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 42 [2023-12-24 21:37:04,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:37:04,977 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-12-24 21:37:04,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 38 states have internal predecessors, (64), 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:37:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-12-24 21:37:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-24 21:37:04,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:37:04,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:37:04,986 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 (24)] Ended with exit code 0 [2023-12-24 21:37:05,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-24 21:37:05,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:37:05,380 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:37:05,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:37:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2118499494, now seen corresponding path program 2 times [2023-12-24 21:37:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:37:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093376609] [2023-12-24 21:37:05,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:37:05,382 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:37:05,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:37:05,383 INFO L229 MonitoredProcess]: Starting monitored process 26 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:37:05,385 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 (26)] Waiting until timeout for monitored process [2023-12-24 21:37:05,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:37:05,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:37:05,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 82 conjunts are in the unsatisfiable core [2023-12-24 21:37:05,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:37:05,735 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:37:06,253 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:37:06,253 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:37:06,354 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:37:06,386 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:37:06,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:37:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:37:06,547 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 24 treesize of output 11 [2023-12-24 21:37:07,019 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:37:07,028 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:37:07,037 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:37:07,331 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:37:07,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:07,519 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:37:07,603 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:37:07,603 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:37:07,670 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:37:09,176 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:37:09,177 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 79 [2023-12-24 21:37:09,276 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:37:09,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 126 [2023-12-24 21:37:09,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:09,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2023-12-24 21:37:09,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:09,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2023-12-24 21:37:09,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:09,376 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 82 treesize of output 55 [2023-12-24 21:37:09,392 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 42 treesize of output 23 [2023-12-24 21:37:09,629 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 97 treesize of output 65 [2023-12-24 21:37:10,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:37:10,510 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 66 treesize of output 33 [2023-12-24 21:37:10,521 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 15 treesize of output 7 [2023-12-24 21:37:10,714 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 15 treesize of output 7 [2023-12-24 21:37:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:37:10,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:37:11,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2447 (_ BitVec 32)) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2443)) (.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2444)) (.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 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2441))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_2447))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-12-24 21:37:12,129 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2447 (_ BitVec 32)) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2443)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2444)) (.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 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_2441))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) v_ArrVal_2447))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-24 21:37:14,950 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2447 (_ BitVec 32)) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse9) .cse10)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse10)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2443)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2444)) (.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 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)))) (select (select (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_2441))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_2447))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-24 21:37:15,990 INFO L349 Elim1Store]: treesize reduction 955, result has 50.3 percent of original size [2023-12-24 21:37:15,991 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 6022 treesize of output 6008 [2023-12-24 21:37:16,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:37:16,265 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 2784 treesize of output 2784 [2023-12-24 21:37:16,334 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 3771 treesize of output 3060 [2023-12-24 21:37:16,950 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 240 treesize of output 3 [2023-12-24 21:37:17,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:37:17,129 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 3266 treesize of output 3033 [2023-12-24 21:37:31,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_append_~data#1|)) (.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 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse3 (select (select .cse4 .cse7) .cse8))) (or (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454))) (let ((.cse5 (bvadd (_ bv4 32) (select (select .cse6 .cse7) .cse8)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select .cse4 .cse3) .cse5 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select .cse6 .cse3) .cse5 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))) (not (= .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)))))))) (or (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32)) (v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse10 (select (select .cse11 .cse7) .cse8)) (.cse12 (bvadd (_ bv4 32) (select (select .cse13 .cse7) .cse8)))) (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| .cse10 (store (select .cse11 .cse10) .cse12 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse9 (select (select .cse9 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse10 (store (select .cse13 .cse10) .cse12 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))))) .cse14) (or (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32)) (v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse15 (select (select .cse17 .cse7) .cse8))) (= .cse15 (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454))) (let ((.cse18 (bvadd (_ bv4 32) (select (select .cse19 .cse7) .cse8)))) (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| .cse15 (store (select .cse17 .cse15) .cse18 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse16 (select (select .cse16 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse15 (store (select .cse19 .cse15) .cse18 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2)))))))))) .cse14) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455) .cse7) .cse8) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse25 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse24 (select (select .cse25 .cse7) .cse8)) (.cse26 (bvadd (_ bv4 32) (select (select .cse27 .cse7) .cse8)))) (let ((.cse23 (store (store |c_#memory_$Pointer$#1.offset| .cse24 (store (select .cse27 .cse24) .cse26 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443)) (.cse20 (store (store |c_#memory_$Pointer$#1.base| .cse24 (store (select .cse25 .cse24) .cse26 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (let ((.cse21 (select (select .cse20 .cse1) .cse2)) (.cse22 (bvadd (_ bv4 32) (select (select .cse23 .cse1) .cse2)))) (or (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (select (select .cse20 .cse21) .cse22))) (= (select (select .cse23 .cse21) .cse22) (_ bv0 32)))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse32 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse29 (select (select .cse30 .cse7) .cse8)) (.cse31 (bvadd (_ bv4 32) (select (select .cse32 .cse7) .cse8)))) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.offset| .cse29 (store (select .cse32 .cse29) .cse31 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443))) (select (select .cse28 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse29 (store (select .cse30 .cse29) .cse31 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444) .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse28 .cse1) .cse2)))))) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (let ((.cse37 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse35 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse34 (select (select .cse35 .cse7) .cse8)) (.cse36 (bvadd (_ bv4 32) (select (select .cse37 .cse7) .cse8)))) (select (let ((.cse33 (store (store |c_#memory_$Pointer$#1.base| .cse34 (store (select .cse35 .cse34) .cse36 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse33 (select (select .cse33 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse34 (store (select .cse37 .cse34) .cse36 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse39 (select (select .cse41 .cse7) .cse8))) (let ((.cse38 (let ((.cse43 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454))) (let ((.cse42 (bvadd (_ bv4 32) (select (select .cse43 .cse7) .cse8)))) (select (let ((.cse40 (store (store |c_#memory_$Pointer$#1.base| .cse39 (store (select .cse41 .cse39) .cse42 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse40 (select (select .cse40 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse39 (store (select .cse43 .cse39) .cse42 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| .cse38) (= .cse39 .cse38)))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse49 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse47 (select (select .cse49 .cse7) .cse8)) (.cse50 (bvadd (_ bv4 32) (select (select .cse51 .cse7) .cse8)))) (let ((.cse44 (store (store |c_#memory_$Pointer$#1.offset| .cse47 (store (select .cse51 .cse47) .cse50 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443)) (.cse48 (store (store |c_#memory_$Pointer$#1.base| .cse47 (store (select .cse49 .cse47) .cse50 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (let ((.cse45 (select (select .cse48 .cse1) .cse2)) (.cse46 (bvadd (_ bv4 32) (select (select .cse44 .cse1) .cse2)))) (or (= (select (select .cse44 .cse45) .cse46) (_ bv0 32)) (= .cse47 (select (select .cse48 .cse45) .cse46)))))))))))) is different from false [2023-12-24 21:37:35,152 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_append_~data#1|)) (.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 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse3 (select (select .cse4 .cse7) .cse8))) (or (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454))) (let ((.cse5 (bvadd (_ bv4 32) (select (select .cse6 .cse7) .cse8)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select .cse4 .cse3) .cse5 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select .cse6 .cse3) .cse5 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))) (not (= .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)))))))) (or (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32)) (v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse10 (select (select .cse11 .cse7) .cse8)) (.cse12 (bvadd (_ bv4 32) (select (select .cse13 .cse7) .cse8)))) (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| .cse10 (store (select .cse11 .cse10) .cse12 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse9 (select (select .cse9 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse10 (store (select .cse13 .cse10) .cse12 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))))) .cse14) (or (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32)) (v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse15 (select (select .cse17 .cse7) .cse8))) (= .cse15 (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454))) (let ((.cse18 (bvadd (_ bv4 32) (select (select .cse19 .cse7) .cse8)))) (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| .cse15 (store (select .cse17 .cse15) .cse18 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse16 (select (select .cse16 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse15 (store (select .cse19 .cse15) .cse18 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2)))))))))) .cse14) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455) .cse7) .cse8) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse25 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse24 (select (select .cse25 .cse7) .cse8)) (.cse26 (bvadd (_ bv4 32) (select (select .cse27 .cse7) .cse8)))) (let ((.cse23 (store (store |c_#memory_$Pointer$#1.offset| .cse24 (store (select .cse27 .cse24) .cse26 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443)) (.cse20 (store (store |c_#memory_$Pointer$#1.base| .cse24 (store (select .cse25 .cse24) .cse26 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (let ((.cse21 (select (select .cse20 .cse1) .cse2)) (.cse22 (bvadd (_ bv4 32) (select (select .cse23 .cse1) .cse2)))) (or (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (select (select .cse20 .cse21) .cse22))) (= (select (select .cse23 .cse21) .cse22) (_ bv0 32)))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse32 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse29 (select (select .cse30 .cse7) .cse8)) (.cse31 (bvadd (_ bv4 32) (select (select .cse32 .cse7) .cse8)))) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.offset| .cse29 (store (select .cse32 .cse29) .cse31 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443))) (select (select .cse28 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse29 (store (select .cse30 .cse29) .cse31 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444) .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse28 .cse1) .cse2)))))) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (let ((.cse37 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse35 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse34 (select (select .cse35 .cse7) .cse8)) (.cse36 (bvadd (_ bv4 32) (select (select .cse37 .cse7) .cse8)))) (select (let ((.cse33 (store (store |c_#memory_$Pointer$#1.base| .cse34 (store (select .cse35 .cse34) .cse36 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse33 (select (select .cse33 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse34 (store (select .cse37 .cse34) .cse36 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse39 (select (select .cse41 .cse7) .cse8))) (let ((.cse38 (let ((.cse43 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454))) (let ((.cse42 (bvadd (_ bv4 32) (select (select .cse43 .cse7) .cse8)))) (select (let ((.cse40 (store (store |c_#memory_$Pointer$#1.base| .cse39 (store (select .cse41 .cse39) .cse42 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (select .cse40 (select (select .cse40 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse39 (store (select .cse43 .cse39) .cse42 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443) .cse1) .cse2))))))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| .cse38) (= .cse39 .cse38)))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|) (_ bv0 1))) (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2454)) (.cse49 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2455))) (let ((.cse47 (select (select .cse49 .cse7) .cse8)) (.cse50 (bvadd (_ bv4 32) (select (select .cse51 .cse7) .cse8)))) (let ((.cse44 (store (store |c_#memory_$Pointer$#1.offset| .cse47 (store (select .cse51 .cse47) .cse50 (_ bv0 32))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2443)) (.cse48 (store (store |c_#memory_$Pointer$#1.base| .cse47 (store (select .cse49 .cse47) .cse50 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_91| v_ArrVal_2444))) (let ((.cse45 (select (select .cse48 .cse1) .cse2)) (.cse46 (bvadd (_ bv4 32) (select (select .cse44 .cse1) .cse2)))) (or (= (select (select .cse44 .cse45) .cse46) (_ bv0 32)) (= .cse47 (select (select .cse48 .cse45) .cse46)))))))))))) is different from true [2023-12-24 21:37:35,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:37:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093376609] [2023-12-24 21:37:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093376609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:37:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720288739] [2023-12-24 21:37:35,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:37:35,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:37:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:37:35,156 INFO L229 MonitoredProcess]: Starting monitored process 27 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:37:35,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-12-24 21:37:35,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:37:35,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:37:35,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 87 conjunts are in the unsatisfiable core [2023-12-24 21:37:35,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:37:35,902 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:37:36,991 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:37:36,991 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:37:37,342 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:37:37,365 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:37:37,788 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:37:37,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:37:37,804 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 24 treesize of output 11 [2023-12-24 21:37:38,988 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:37:38,998 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:37:39,007 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:37:39,683 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:37:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:44,155 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:37:44,245 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:37:44,245 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:37:44,282 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:37:46,773 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-24 21:37:46,773 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 97 [2023-12-24 21:37:46,916 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-24 21:37:46,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 152 [2023-12-24 21:37:46,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:46,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2023-12-24 21:37:46,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:37:46,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2023-12-24 21:37:47,009 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 143 treesize of output 23 [2023-12-24 21:37:47,506 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 97 treesize of output 65 [2023-12-24 21:37:49,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:37:49,375 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 77 treesize of output 40 [2023-12-24 21:37:49,391 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 15 treesize of output 7 [2023-12-24 21:37:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:37:50,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:25,573 WARN L293 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 140 DAG size of output: 119 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:38:25,573 INFO L349 Elim1Store]: treesize reduction 4727, result has 46.3 percent of original size [2023-12-24 21:38:25,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 7106 treesize of output 10010 [2023-12-24 21:38:25,776 INFO L224 Elim1Store]: Index analysis took 158 ms [2023-12-24 21:38:27,807 INFO L349 Elim1Store]: treesize reduction 2074, result has 45.6 percent of original size [2023-12-24 21:38:27,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 4110 treesize of output 5435 [2023-12-24 21:38:28,004 INFO L224 Elim1Store]: Index analysis took 158 ms [2023-12-24 21:38:28,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:28,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4257 treesize of output 4624 [2023-12-24 21:38:33,106 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:39:21,327 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:40:04,519 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 240 treesize of output 3 [2023-12-24 21:40:04,568 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 87 treesize of output 4 [2023-12-24 21:40:04,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:40:04,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 604 treesize of output 525 [2023-12-24 21:40:05,080 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 240 treesize of output 3 [2023-12-24 21:40:05,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:40:05,239 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 1216 treesize of output 1220 [2023-12-24 21:40:05,274 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 1126 treesize of output 652 [2023-12-24 21:40:06,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:40:06,007 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 328 treesize of output 332 [2023-12-24 21:40:06,277 INFO L349 Elim1Store]: treesize reduction 656, result has 0.2 percent of original size [2023-12-24 21:40:06,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 844 treesize of output 1 [2023-12-24 21:40:06,487 INFO L224 Elim1Store]: Index analysis took 138 ms [2023-12-24 21:40:06,501 INFO L349 Elim1Store]: treesize reduction 656, result has 0.2 percent of original size [2023-12-24 21:40:06,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1216 treesize of output 1 [2023-12-24 21:40:08,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:40:08,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10293 treesize of output 8385 [2023-12-24 21:42:13,226 INFO L224 Elim1Store]: Index analysis took 114 ms [2023-12-24 21:42:13,238 INFO L349 Elim1Store]: treesize reduction 656, result has 0.2 percent of original size [2023-12-24 21:42:13,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7543 treesize of output 1 [2023-12-24 21:42:13,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:13,761 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 4729 treesize of output 4022 [2023-12-24 21:42:13,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:13,928 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 3779 treesize of output 3700 [2023-12-24 21:42:16,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:16,455 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 2815 treesize of output 2570 [2023-12-24 21:42:17,528 INFO L224 Elim1Store]: Index analysis took 374 ms [2023-12-24 21:42:18,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:18,520 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 2481 treesize of output 2248 [2023-12-24 21:42:23,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 87 treesize of output 4 [2023-12-24 21:42:27,131 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 87 treesize of output 4 [2023-12-24 21:42:39,627 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 21:42:49,018 INFO L224 Elim1Store]: Index analysis took 267 ms [2023-12-24 21:42:50,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:42:50,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4855 treesize of output 4395 [2023-12-24 21:43:19,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:43:19,058 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 1040 treesize of output 1044 [2023-12-24 21:43:23,867 INFO L349 Elim1Store]: treesize reduction 324, result has 53.4 percent of original size [2023-12-24 21:43:23,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3845 treesize of output 2955 Received shutdown request... [2023-12-24 21:43:45,830 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:43:45,847 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 (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:43:45,847 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:43:46,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-12-24 21:43:46,860 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 (26)] Forceful destruction successful, exit code 0 [2023-12-24 21:43:47,031 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:43:47,105 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:43:47,108 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:43:47,108 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 44 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-24 21:43:47,111 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:43:47,112 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:43:47,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:43:47 BoogieIcfgContainer [2023-12-24 21:43:47,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:43:47,114 INFO L158 Benchmark]: Toolchain (without parser) took 875466.77ms. Allocated memory was 266.3MB in the beginning and 329.3MB in the end (delta: 62.9MB). Free memory was 213.6MB in the beginning and 194.6MB in the end (delta: 18.9MB). Peak memory consumption was 194.4MB. Max. memory is 8.0GB. [2023-12-24 21:43:47,114 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 208.7MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:43:47,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.00ms. Allocated memory is still 266.3MB. Free memory was 213.3MB in the beginning and 194.0MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:43:47,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.62ms. Allocated memory is still 266.3MB. Free memory was 194.0MB in the beginning and 191.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:43:47,114 INFO L158 Benchmark]: Boogie Preprocessor took 48.81ms. Allocated memory is still 266.3MB. Free memory was 191.6MB in the beginning and 188.1MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:43:47,114 INFO L158 Benchmark]: RCFGBuilder took 519.75ms. Allocated memory is still 266.3MB. Free memory was 187.9MB in the beginning and 217.6MB in the end (delta: -29.8MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2023-12-24 21:43:47,114 INFO L158 Benchmark]: TraceAbstraction took 874472.26ms. Allocated memory was 266.3MB in the beginning and 329.3MB in the end (delta: 62.9MB). Free memory was 217.1MB in the beginning and 194.6MB in the end (delta: 22.5MB). Peak memory consumption was 196.7MB. Max. memory is 8.0GB. [2023-12-24 21:43:47,115 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.11ms. Allocated memory is still 208.7MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 376.00ms. Allocated memory is still 266.3MB. Free memory was 213.3MB in the beginning and 194.0MB in the end (delta: 19.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.62ms. Allocated memory is still 266.3MB. Free memory was 194.0MB in the beginning and 191.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.81ms. Allocated memory is still 266.3MB. Free memory was 191.6MB in the beginning and 188.1MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 519.75ms. Allocated memory is still 266.3MB. Free memory was 187.9MB in the beginning and 217.6MB in the end (delta: -29.8MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * TraceAbstraction took 874472.26ms. Allocated memory was 266.3MB in the beginning and 329.3MB in the end (delta: 62.9MB). Free memory was 217.1MB in the beginning and 194.6MB in the end (delta: 22.5MB). Peak memory consumption was 196.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 645). Cancelled while NwaCegarLoop was analyzing trace of length 44 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 874.4s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 123.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 701 SdHoareTripleChecker+Valid, 70.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 697 mSDsluCounter, 4660 SdHoareTripleChecker+Invalid, 67.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 4301 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7888 IncrementalHoareTripleChecker+Invalid, 8010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 359 mSDtfsCounter, 7888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1241 GetRequests, 608 SyntacticMatches, 3 SemanticMatches, 630 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 8587 ImplicationChecksByTransitivity, 348.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=12, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 108 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 336.6s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 828 ConstructedInterpolants, 207 QuantifiedInterpolants, 23339 SizeOfPredicates, 433 NumberOfNonLiveVariables, 6037 ConjunctsInSsa, 1266 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 242/434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown