/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:56:42,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:56:42,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:56:42,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:56:42,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:56:42,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:56:42,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:56:42,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:56:42,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:56:42,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:56:42,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:56:42,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:56:42,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:56:42,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:56:42,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:56:42,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:56:42,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:56:42,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:56:42,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:56:42,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:56:42,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:56:42,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:56:42,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:56:42,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:56:42,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:56:42,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:56:42,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:56:42,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:56:42,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:56:42,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:56:42,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:56:42,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:56:42,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:56:42,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:56:42,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:56:42,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:56:42,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:56:42,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:56:42,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:56:42,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:56:42,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:56:42,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 17:56:42,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:56:42,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:56:42,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:56:42,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:56:42,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:56:42,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:56:42,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:56:42,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:56:42,198 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:56:42,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:56:42,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:56:42,199 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:56:42,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:56:42,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:56:42,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:56:42,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:56:42,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:56:42,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:56:42,200 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:56:42,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:56:42,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:56:42,201 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:56:42,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:56:42,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:56:42,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:56:42,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:56:42,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:56:42,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:56:42,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:56:42,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:56:42,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:56:42,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:56:42,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:56:42,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-16 17:56:42,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:56:42,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:56:42,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:56:42,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:56:42,621 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:56:42,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i [2022-10-16 17:56:42,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0afcf781/1eb821e746a74e5f80488ecf8569cea6/FLAG49d36f056 [2022-10-16 17:56:43,542 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:56:43,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Break-alloca.i [2022-10-16 17:56:43,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0afcf781/1eb821e746a74e5f80488ecf8569cea6/FLAG49d36f056 [2022-10-16 17:56:43,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0afcf781/1eb821e746a74e5f80488ecf8569cea6 [2022-10-16 17:56:43,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:56:43,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:56:43,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:56:43,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:56:43,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:56:43,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:56:43" (1/1) ... [2022-10-16 17:56:43,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23611f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:43, skipping insertion in model container [2022-10-16 17:56:43,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:56:43" (1/1) ... [2022-10-16 17:56:43,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:56:43,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:56:44,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:56:44,271 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:56:44,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:56:44,382 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:56:44,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44 WrapperNode [2022-10-16 17:56:44,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:56:44,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:56:44,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:56:44,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:56:44,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,444 INFO L138 Inliner]: procedures = 109, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-10-16 17:56:44,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:56:44,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:56:44,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:56:44,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:56:44,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,468 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:56:44,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:56:44,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:56:44,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:56:44,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (1/1) ... [2022-10-16 17:56:44,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:56:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:44,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 17:56:44,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 17:56:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 17:56:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 17:56:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 17:56:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 17:56:44,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:56:44,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:56:44,684 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:56:44,686 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:56:44,819 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:56:44,827 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:56:44,827 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 17:56:44,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:56:44 BoogieIcfgContainer [2022-10-16 17:56:44,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:56:44,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:56:44,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:56:44,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:56:44,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:56:43" (1/3) ... [2022-10-16 17:56:44,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162931a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:56:44, skipping insertion in model container [2022-10-16 17:56:44,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:56:44" (2/3) ... [2022-10-16 17:56:44,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162931a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:56:44, skipping insertion in model container [2022-10-16 17:56:44,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:56:44" (3/3) ... [2022-10-16 17:56:44,843 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Break-alloca.i [2022-10-16 17:56:44,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:56:44,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 17:56:44,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:56:44,962 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1ab03afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:56:44,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 17:56:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 17:56:44,989 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:44,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 17:56:44,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 28699817, now seen corresponding path program 1 times [2022-10-16 17:56:45,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:45,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708232274] [2022-10-16 17:56:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:45,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:45,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708232274] [2022-10-16 17:56:45,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708232274] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:56:45,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:56:45,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 17:56:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542699438] [2022-10-16 17:56:45,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:56:45,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 17:56:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:45,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 17:56:45,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:56:45,509 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:45,579 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-10-16 17:56:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 17:56:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-16 17:56:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:45,591 INFO L225 Difference]: With dead ends: 20 [2022-10-16 17:56:45,592 INFO L226 Difference]: Without dead ends: 11 [2022-10-16 17:56:45,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:56:45,602 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:45,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:56:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-10-16 17:56:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-10-16 17:56:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-10-16 17:56:45,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 5 [2022-10-16 17:56:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:45,639 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-10-16 17:56:45,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-10-16 17:56:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 17:56:45,640 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:45,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 17:56:45,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:56:45,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 889694377, now seen corresponding path program 1 times [2022-10-16 17:56:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:45,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219181343] [2022-10-16 17:56:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:46,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219181343] [2022-10-16 17:56:46,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219181343] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:56:46,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:56:46,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 17:56:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124407526] [2022-10-16 17:56:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:56:46,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 17:56:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:46,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 17:56:46,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:56:46,041 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:46,071 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-10-16 17:56:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 17:56:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 17:56:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:46,072 INFO L225 Difference]: With dead ends: 16 [2022-10-16 17:56:46,072 INFO L226 Difference]: Without dead ends: 15 [2022-10-16 17:56:46,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:56:46,075 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:46,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:56:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-10-16 17:56:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-10-16 17:56:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-10-16 17:56:46,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2022-10-16 17:56:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:46,082 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-10-16 17:56:46,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-10-16 17:56:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 17:56:46,083 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:46,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:56:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:56:46,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1810721963, now seen corresponding path program 1 times [2022-10-16 17:56:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:46,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025865107] [2022-10-16 17:56:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:46,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025865107] [2022-10-16 17:56:46,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025865107] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:56:46,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:56:46,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 17:56:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848121050] [2022-10-16 17:56:46,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:56:46,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 17:56:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 17:56:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:56:46,328 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:46,364 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-10-16 17:56:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 17:56:46,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 17:56:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:46,366 INFO L225 Difference]: With dead ends: 19 [2022-10-16 17:56:46,366 INFO L226 Difference]: Without dead ends: 17 [2022-10-16 17:56:46,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:56:46,368 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:46,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:56:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-10-16 17:56:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-10-16 17:56:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-10-16 17:56:46,378 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2022-10-16 17:56:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:46,379 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-10-16 17:56:46,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-10-16 17:56:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 17:56:46,383 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:46,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 17:56:46,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:56:46,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1919881554, now seen corresponding path program 1 times [2022-10-16 17:56:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:46,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19495882] [2022-10-16 17:56:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:46,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19495882] [2022-10-16 17:56:46,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19495882] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:46,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486808530] [2022-10-16 17:56:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:46,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:46,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:46,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 17:56:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:46,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 17:56:46,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:47,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-10-16 17:56:47,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:56:47,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-10-16 17:56:47,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-10-16 17:56:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:47,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:56:47,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_70 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_70) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)))) is different from false [2022-10-16 17:56:47,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:56:47,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-10-16 17:56:47,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-10-16 17:56:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:47,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486808530] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:56:47,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:56:47,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-10-16 17:56:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927690753] [2022-10-16 17:56:47,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:56:47,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 17:56:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 17:56:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=113, Unknown=1, NotChecked=22, Total=182 [2022-10-16 17:56:47,342 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:47,418 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-10-16 17:56:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:56:47,419 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 17:56:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:47,419 INFO L225 Difference]: With dead ends: 17 [2022-10-16 17:56:47,420 INFO L226 Difference]: Without dead ends: 16 [2022-10-16 17:56:47,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=146, Unknown=1, NotChecked=26, Total=240 [2022-10-16 17:56:47,422 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:47,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 20 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-10-16 17:56:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-10-16 17:56:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-10-16 17:56:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-10-16 17:56:47,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-10-16 17:56:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:47,427 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-10-16 17:56:47,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-10-16 17:56:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 17:56:47,428 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:47,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-10-16 17:56:47,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 17:56:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:47,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash -613213918, now seen corresponding path program 1 times [2022-10-16 17:56:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:47,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66629600] [2022-10-16 17:56:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:47,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66629600] [2022-10-16 17:56:47,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66629600] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:47,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937912134] [2022-10-16 17:56:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:47,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:47,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 17:56:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:47,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 17:56:47,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:48,049 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:56:48,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:56:48,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:56:48,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-10-16 17:56:48,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-10-16 17:56:48,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:48,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-10-16 17:56:48,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:56:48,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:56:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:56:48,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:56:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:48,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:56:48,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_114 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:56:48,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 Int) (v_ArrVal_114 (Array Int Int))) (or (not (<= v_ArrVal_112 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_112)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:56:48,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_111))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_112)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_112))))) is different from false [2022-10-16 17:56:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-10-16 17:56:48,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937912134] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:56:48,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:56:48,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 17:56:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357388444] [2022-10-16 17:56:48,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:56:48,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 17:56:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 17:56:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=50, Unknown=3, NotChecked=48, Total=132 [2022-10-16 17:56:48,453 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:48,546 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-10-16 17:56:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 17:56:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 17:56:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:48,549 INFO L225 Difference]: With dead ends: 24 [2022-10-16 17:56:48,549 INFO L226 Difference]: Without dead ends: 23 [2022-10-16 17:56:48,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=72, Unknown=3, NotChecked=60, Total=182 [2022-10-16 17:56:48,554 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:48,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 22 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 38 Unchecked, 0.0s Time] [2022-10-16 17:56:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-16 17:56:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-10-16 17:56:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-10-16 17:56:48,563 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 13 [2022-10-16 17:56:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:48,564 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-10-16 17:56:48,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-10-16 17:56:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 17:56:48,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:48,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-10-16 17:56:48,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 17:56:48,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:48,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1829762220, now seen corresponding path program 1 times [2022-10-16 17:56:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:48,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888176178] [2022-10-16 17:56:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:48,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888176178] [2022-10-16 17:56:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888176178] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124374520] [2022-10-16 17:56:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:49,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:49,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 17:56:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:49,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 17:56:49,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:49,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-10-16 17:56:49,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:56:49,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:56:49,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-10-16 17:56:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:49,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:56:49,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_153 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_153) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483650))) is different from false [2022-10-16 17:56:49,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:56:49,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-10-16 17:56:49,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-10-16 17:56:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-16 17:56:49,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124374520] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:56:49,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:56:49,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-10-16 17:56:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037574372] [2022-10-16 17:56:49,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:56:49,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 17:56:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 17:56:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=63, Unknown=1, NotChecked=16, Total=110 [2022-10-16 17:56:49,315 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:49,372 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-10-16 17:56:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:56:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 17:56:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:49,373 INFO L225 Difference]: With dead ends: 21 [2022-10-16 17:56:49,374 INFO L226 Difference]: Without dead ends: 20 [2022-10-16 17:56:49,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=89, Unknown=1, NotChecked=20, Total=156 [2022-10-16 17:56:49,375 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:49,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-10-16 17:56:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-16 17:56:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-10-16 17:56:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-10-16 17:56:49,380 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2022-10-16 17:56:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:49,380 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-10-16 17:56:49,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-10-16 17:56:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 17:56:49,381 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:49,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1] [2022-10-16 17:56:49,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 17:56:49,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:49,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash 437080153, now seen corresponding path program 2 times [2022-10-16 17:56:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:49,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339486650] [2022-10-16 17:56:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339486650] [2022-10-16 17:56:49,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339486650] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112886932] [2022-10-16 17:56:49,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:56:49,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:49,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:49,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:50,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 17:56:50,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:56:50,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:56:50,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-16 17:56:50,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:50,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-10-16 17:56:50,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:56:50,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-10-16 17:56:50,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:56:50,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:56:50,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:56:50,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:56:50,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:56:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:56:50,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:56:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:50,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:56:50,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_208 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:56:50,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_208 (Array Int Int)) (v_ArrVal_207 Int)) (or (not (<= v_ArrVal_207 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_207)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:56:50,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_207 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_205))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_207)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_207))))) is different from false [2022-10-16 17:56:50,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 Int) (v_ArrVal_205 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_207 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_203)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_205))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_207) (not (<= v_ArrVal_203 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_207)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:56:50,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 Int) (v_ArrVal_205 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_207 Int) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_202))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_203)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_205))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_207) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_207)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_203))))))) is different from false [2022-10-16 17:56:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-10-16 17:56:50,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112886932] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:56:50,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:56:50,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-10-16 17:56:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682335773] [2022-10-16 17:56:50,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:56:50,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 17:56:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:50,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 17:56:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=92, Unknown=5, NotChecked=120, Total=272 [2022-10-16 17:56:50,585 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:50,694 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-10-16 17:56:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 17:56:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 17:56:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:50,696 INFO L225 Difference]: With dead ends: 28 [2022-10-16 17:56:50,696 INFO L226 Difference]: Without dead ends: 27 [2022-10-16 17:56:50,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=122, Unknown=5, NotChecked=140, Total=342 [2022-10-16 17:56:50,698 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:50,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-10-16 17:56:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-16 17:56:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-10-16 17:56:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-10-16 17:56:50,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2022-10-16 17:56:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:50,704 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-10-16 17:56:50,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-10-16 17:56:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 17:56:50,705 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:50,705 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1] [2022-10-16 17:56:50,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 17:56:50,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:50,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:56:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1364787792, now seen corresponding path program 3 times [2022-10-16 17:56:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070122544] [2022-10-16 17:56:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:51,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:51,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070122544] [2022-10-16 17:56:51,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070122544] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989224446] [2022-10-16 17:56:51,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:56:51,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:51,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:51,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:51,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 17:56:51,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 17:56:51,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:56:51,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-16 17:56:51,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:51,496 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:56:51,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:56:51,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:56:51,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-10-16 17:56:51,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 42 treesize of output 22 [2022-10-16 17:56:51,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 17:56:51,735 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-10-16 17:56:51,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 62 [2022-10-16 17:56:51,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:56:51,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:56:51,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:51,910 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:56:51,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 24 [2022-10-16 17:56:51,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:52,050 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:56:52,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 24 [2022-10-16 17:56:52,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:52,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:56:52,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 40 [2022-10-16 17:56:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:52,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:56:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 29 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:53,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989224446] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:56:53,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:56:53,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-10-16 17:56:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874629346] [2022-10-16 17:56:53,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:56:53,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 17:56:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:53,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 17:56:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=660, Unknown=28, NotChecked=0, Total=870 [2022-10-16 17:56:53,649 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 30 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:54,449 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_267 Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int) (v_ArrVal_266 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_266))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_267)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_269))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_270)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_267) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_270) (< (select (select (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ .cse4 1) v_ArrVal_272) (< 10 .cse4)))))))))) (forall ((v_ArrVal_272 Int) (v_ArrVal_270 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_269))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_270)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (select (select (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_270) (< (+ .cse10 1) v_ArrVal_272) (< 10 .cse10)))))))) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (forall ((v_ArrVal_272 Int)) (or (< (+ .cse12 1) v_ArrVal_272) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) (< 10 .cse12))))) is different from false [2022-10-16 17:57:07,715 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 Int) (v_ArrVal_270 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_269))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_270)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_270) (< (+ .cse3 1) v_ArrVal_272) (< 10 .cse3)))))))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (forall ((v_ArrVal_272 Int)) (or (< (+ .cse5 1) v_ArrVal_272) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) (< 10 .cse5))))) is different from false [2022-10-16 17:57:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:08,125 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-10-16 17:57:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-16 17:57:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 30 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 17:57:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:08,126 INFO L225 Difference]: With dead ends: 51 [2022-10-16 17:57:08,126 INFO L226 Difference]: Without dead ends: 50 [2022-10-16 17:57:08,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=616, Invalid=1960, Unknown=84, NotChecked=202, Total=2862 [2022-10-16 17:57:08,129 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:08,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 28 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 83 Unchecked, 0.0s Time] [2022-10-16 17:57:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-16 17:57:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-16 17:57:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-10-16 17:57:08,138 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 25 [2022-10-16 17:57:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:08,139 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-10-16 17:57:08,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 30 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-10-16 17:57:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 17:57:08,141 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:08,141 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1] [2022-10-16 17:57:08,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 17:57:08,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:08,355 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1105024428, now seen corresponding path program 4 times [2022-10-16 17:57:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:08,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473657911] [2022-10-16 17:57:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:09,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473657911] [2022-10-16 17:57:09,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473657911] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:09,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735978489] [2022-10-16 17:57:09,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 17:57:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:09,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:57:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 17:57:09,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 17:57:09,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:57:09,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 57 conjunts are in the unsatisfiable core [2022-10-16 17:57:09,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:09,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-10-16 17:57:09,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:57:09,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2022-10-16 17:57:10,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:57:10,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:10,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:10,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:57:10,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:57:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:10,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:10,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:57:10,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_380 Int)) (or (not (<= v_ArrVal_380 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:57:10,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:57:10,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ 1 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|)) v_ArrVal_380) (not (<= v_ArrVal_378 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))))))) is different from false [2022-10-16 17:57:10,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380))))))) is different from false [2022-10-16 17:57:10,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (not (<= v_ArrVal_374 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380))))))) is different from false [2022-10-16 17:57:10,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378))))))))) is different from false [2022-10-16 17:57:11,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (not (<= v_ArrVal_371 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))))))) is different from false [2022-10-16 17:57:11,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_371) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380))))))))))) is different from false [2022-10-16 17:57:11,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_369)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (not (<= v_ArrVal_369 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_371))))))))))) is different from false [2022-10-16 17:57:11,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_367 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_367))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_369)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_371) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_369) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374))))))))))))) is different from false [2022-10-16 17:57:11,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_367 (Array Int Int)) (v_ArrVal_369 Int) (v_ArrVal_378 Int) (v_ArrVal_365 Int) (v_ArrVal_374 Int) (v_ArrVal_371 Int) (v_ArrVal_380 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_365)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_367))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_369)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_369) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_371) (not (<= v_ArrVal_365 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))))))))))))))) is different from false [2022-10-16 17:57:11,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_364 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_367 (Array Int Int)) (v_ArrVal_369 Int) (v_ArrVal_378 Int) (v_ArrVal_365 Int) (v_ArrVal_374 Int) (v_ArrVal_371 Int) (v_ArrVal_380 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_364))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_365)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_367))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_369)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_365) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_371) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_369) (< (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374))))))))))))))) is different from false [2022-10-16 17:57:12,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_364 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_367 (Array Int Int)) (v_ArrVal_369 Int) (v_ArrVal_378 Int) (v_ArrVal_365 Int) (v_ArrVal_363 Int) (v_ArrVal_374 Int) (v_ArrVal_371 Int) (v_ArrVal_380 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_363)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_364))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_365)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_367))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_369)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_371) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_369) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (not (<= v_ArrVal_363 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_365))))))))))))))) is different from false [2022-10-16 17:57:12,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_373 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_364 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_367 (Array Int Int)) (v_ArrVal_369 Int) (v_ArrVal_378 Int) (v_ArrVal_365 Int) (v_ArrVal_363 Int) (v_ArrVal_374 Int) (v_ArrVal_371 Int) (v_ArrVal_380 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_361))) (let ((.cse7 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_363)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_364))) (let ((.cse4 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_365)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_367))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_369)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_370))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_371)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_373))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_376))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_378)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_379))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_378) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_380)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_369) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_365) (< (+ 1 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|)) v_ArrVal_371) (< (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_374) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_380) (< (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_363))))))))))))))))) is different from false [2022-10-16 17:57:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 161 not checked. [2022-10-16 17:57:12,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735978489] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:12,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:12,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 41 [2022-10-16 17:57:12,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122039011] [2022-10-16 17:57:12,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:12,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 17:57:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:12,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 17:57:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=497, Unknown=15, NotChecked=960, Total=1722 [2022-10-16 17:57:12,716 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 42 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:13,329 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-10-16 17:57:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 17:57:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 42 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-10-16 17:57:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:13,331 INFO L225 Difference]: With dead ends: 58 [2022-10-16 17:57:13,331 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 17:57:13,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=567, Unknown=15, NotChecked=1020, Total=1892 [2022-10-16 17:57:13,332 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:13,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 73 Invalid, 0 Unknown, 410 Unchecked, 0.1s Time] [2022-10-16 17:57:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 17:57:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-10-16 17:57:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-10-16 17:57:13,341 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 49 [2022-10-16 17:57:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:13,342 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-10-16 17:57:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 42 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-10-16 17:57:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 17:57:13,344 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:13,344 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1] [2022-10-16 17:57:13,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 17:57:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:13,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash 49708387, now seen corresponding path program 5 times [2022-10-16 17:57:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:13,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261611106] [2022-10-16 17:57:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:15,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261611106] [2022-10-16 17:57:15,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261611106] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:15,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963322784] [2022-10-16 17:57:15,320 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 17:57:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:15,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:57:15,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 17:57:15,495 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-10-16 17:57:15,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:57:15,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 108 conjunts are in the unsatisfiable core [2022-10-16 17:57:15,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:15,557 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:57:15,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:57:15,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:57:15,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 17:57:15,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:57:15,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 31 treesize of output 5 [2022-10-16 17:57:15,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:57:15,911 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-10-16 17:57:15,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 70 [2022-10-16 17:57:15,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:57:15,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 16 treesize of output 13 [2022-10-16 17:57:15,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-10-16 17:57:16,118 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:57:16,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2022-10-16 17:57:16,455 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:16,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-10-16 17:57:16,630 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:57:16,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2022-10-16 17:57:16,904 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:16,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-10-16 17:57:17,082 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:57:17,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2022-10-16 17:57:17,420 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:17,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-10-16 17:57:17,598 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:57:17,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2022-10-16 17:57:17,988 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:17,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-10-16 17:57:18,186 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:57:18,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2022-10-16 17:57:18,492 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:18,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-10-16 17:57:18,693 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:57:18,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2022-10-16 17:57:19,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-10-16 17:57:19,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:19,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-10-16 17:57:19,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-10-16 17:57:19,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:57:19,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:57:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:19,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:19,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:57:19,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int)) (or (not (<= v_ArrVal_506 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:57:19,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:57:19,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (not (<= v_ArrVal_502 (+ |c_ULTIMATE.start_main_#t~post8#1| 1))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:57:19,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502))))))) is different from false [2022-10-16 17:57:20,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse2 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_498)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502)))))))) is different from false [2022-10-16 17:57:20,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< v_ArrVal_498 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)))))))))) is different from false [2022-10-16 17:57:20,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post8#1| 1))))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< 10 (select (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< v_ArrVal_498 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))) is different from false [2022-10-16 17:57:20,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_498 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_493))))))))))) is different from false [2022-10-16 17:57:20,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< v_ArrVal_493 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< 10 (select (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_498 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)))))))))))) is different from false [2022-10-16 17:57:20,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post8#1| 1))))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_498 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_493 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< 10 (select (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ 1 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|)) v_ArrVal_506)))))))))))) is different from false [2022-10-16 17:57:21,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_498 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_493 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< 10 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_489)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502)))))))))))) is different from false [2022-10-16 17:57:21,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_498 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_493 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< 10 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< v_ArrVal_489 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502))))))))))))) is different from false [2022-10-16 17:57:21,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post8#1| 1))))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ 1 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|)))))))) (let ((.cse6 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_489 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_498 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< v_ArrVal_493 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))))))) is different from false [2022-10-16 17:57:22,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_486 Int) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse16 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_486)))) (store .cse17 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_489 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_493 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_486)) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< v_ArrVal_498 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))))))) is different from false [2022-10-16 17:57:23,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_486 Int) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse17 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_486)))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_489 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_493 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< v_ArrVal_498 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_486 (+ (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)))))))))))))))) is different from false [2022-10-16 17:57:23,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_486 Int) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post8#1| 1))))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse17 (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_486)))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|)) v_ArrVal_502) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_506) (< v_ArrVal_498 (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_489 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 10 (select (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_493 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_486 (+ (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))))))))) is different from false [2022-10-16 17:57:24,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_486 Int) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse20 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_481)))) (store .cse21 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse22 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse20 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse17 (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_486)))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse8 (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< v_ArrVal_493 (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_486 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ 1 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|)) v_ArrVal_506) (< v_ArrVal_489 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_481)) (< v_ArrVal_498 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< 10 (select (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))))))))))))))))) is different from false [2022-10-16 17:57:25,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_486 Int) (v_ArrVal_493 Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_481 Int) (v_ArrVal_506 Int) (v_ArrVal_502 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse21 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_481)))) (store .cse22 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse21 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse18 (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_486)))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse18 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse15 (let ((.cse16 (store .cse18 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_489)))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_493)))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_498)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_502)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< v_ArrVal_481 (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_493 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_486 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ 1 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|)) v_ArrVal_506) (< v_ArrVal_489 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_498 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_502) (< 10 (select (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)))))))))))))))))) is different from false [2022-10-16 17:57:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 202 not checked. [2022-10-16 17:57:34,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963322784] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:34,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:34,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 27] total 70 [2022-10-16 17:57:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484160067] [2022-10-16 17:57:34,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:34,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-10-16 17:57:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-10-16 17:57:34,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2333, Unknown=27, NotChecked=2242, Total=4970 [2022-10-16 17:57:34,261 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 71 states, 70 states have (on average 2.3142857142857145) internal successors, (162), 71 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)