/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/array-fpi/sina3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:57:07,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:57:07,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:57:07,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:57:07,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:57:07,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:57:07,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:57:07,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:57:07,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:57:07,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:57:07,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:57:07,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:57:07,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:57:07,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:57:07,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:57:07,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:57:07,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:57:07,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:57:07,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:57:07,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:57:07,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:57:07,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:57:07,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:57:07,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:57:07,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:57:07,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:57:07,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:57:07,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:57:07,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:57:07,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:57:07,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:57:07,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:57:07,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:57:07,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:57:07,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:57:07,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:57:07,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:57:07,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:57:07,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:57:07,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:57:07,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:57:07,266 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 10:57:07,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:57:07,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:57:07,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:57:07,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:57:07,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:57:07,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:57:07,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:57:07,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:57:07,341 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:57:07,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:57:07,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:57:07,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:57:07,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:57:07,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:57:07,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:57:07,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:57:07,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:57:07,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:57:07,343 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:57:07,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:57:07,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:57:07,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:57:07,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:57:07,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:57:07,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:57:07,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:57:07,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:57:07,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:57:07,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:57:07,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:57:07,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:57:07,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:57:07,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:57:07,346 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 10:57:07,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:57:07,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:57:07,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:57:07,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:57:07,742 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:57:07,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina3.c [2022-10-16 10:57:07,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8e85a8b/215f9df3a55e4645b11f366402a127c4/FLAG1f99e7278 [2022-10-16 10:57:08,469 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:57:08,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c [2022-10-16 10:57:08,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8e85a8b/215f9df3a55e4645b11f366402a127c4/FLAG1f99e7278 [2022-10-16 10:57:08,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8e85a8b/215f9df3a55e4645b11f366402a127c4 [2022-10-16 10:57:08,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:57:08,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:57:08,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:57:08,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:57:08,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:57:08,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:57:08" (1/1) ... [2022-10-16 10:57:08,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e00412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:08, skipping insertion in model container [2022-10-16 10:57:08,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:57:08" (1/1) ... [2022-10-16 10:57:08,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:57:08,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:57:09,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-10-16 10:57:09,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:57:09,073 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:57:09,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-10-16 10:57:09,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:57:09,114 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:57:09,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09 WrapperNode [2022-10-16 10:57:09,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:57:09,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:57:09,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:57:09,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:57:09,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,162 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-10-16 10:57:09,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:57:09,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:57:09,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:57:09,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:57:09,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,196 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:57:09,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:57:09,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:57:09,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:57:09,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (1/1) ... [2022-10-16 10:57:09,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:57:09,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:09,237 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 10:57:09,246 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 10:57:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:57:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:57:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:57:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:57:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:57:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:57:09,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:57:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:57:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:57:09,375 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:57:09,377 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:57:09,634 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:57:09,643 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:57:09,644 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-16 10:57:09,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:57:09 BoogieIcfgContainer [2022-10-16 10:57:09,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:57:09,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:57:09,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:57:09,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:57:09,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:57:08" (1/3) ... [2022-10-16 10:57:09,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3e90e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:57:09, skipping insertion in model container [2022-10-16 10:57:09,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:09" (2/3) ... [2022-10-16 10:57:09,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3e90e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:57:09, skipping insertion in model container [2022-10-16 10:57:09,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:57:09" (3/3) ... [2022-10-16 10:57:09,659 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-10-16 10:57:09,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:57:09,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:57:09,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:57:09,802 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;@c58a1bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:57:09,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:57:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 57 states have internal predecessors, (70), 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 10:57:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:57:09,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:09,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:09,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:57:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:09,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291475235] [2022-10-16 10:57:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:10,170 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 10:57:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:10,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291475235] [2022-10-16 10:57:10,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291475235] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:10,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:10,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:57:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713585491] [2022-10-16 10:57:10,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:10,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:57:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:57:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:57:10,235 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 57 states have internal predecessors, (70), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 10:57:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:10,271 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-10-16 10:57:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:57:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-10-16 10:57:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:10,285 INFO L225 Difference]: With dead ends: 112 [2022-10-16 10:57:10,287 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 10:57:10,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:57:10,298 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:10,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 10:57:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-16 10:57:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 52 states have internal predecessors, (57), 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 10:57:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-10-16 10:57:10,365 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 8 [2022-10-16 10:57:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:10,367 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-10-16 10:57:10,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 10:57:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-10-16 10:57:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:57:10,371 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:10,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:10,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:57:10,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:57:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:10,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903190285] [2022-10-16 10:57:10,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:10,635 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 10:57:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:10,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903190285] [2022-10-16 10:57:10,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903190285] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:10,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:10,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930953293] [2022-10-16 10:57:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:10,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:10,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:10,646 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10:57:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:10,761 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-10-16 10:57:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-10-16 10:57:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:10,764 INFO L225 Difference]: With dead ends: 101 [2022-10-16 10:57:10,764 INFO L226 Difference]: Without dead ends: 99 [2022-10-16 10:57:10,765 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 10:57:10,767 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:10,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 108 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-10-16 10:57:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2022-10-16 10:57:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 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 10:57:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-10-16 10:57:10,780 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 8 [2022-10-16 10:57:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:10,781 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-10-16 10:57:10,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10:57:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-10-16 10:57:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:57:10,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:10,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:10,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:57:10,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 678258679, now seen corresponding path program 1 times [2022-10-16 10:57:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:10,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537962262] [2022-10-16 10:57:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:10,943 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 10:57:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:10,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537962262] [2022-10-16 10:57:10,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537962262] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:10,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:10,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:57:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974946016] [2022-10-16 10:57:10,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:10,947 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10:57:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:11,109 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-10-16 10:57:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:11,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-10-16 10:57:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:11,112 INFO L225 Difference]: With dead ends: 135 [2022-10-16 10:57:11,112 INFO L226 Difference]: Without dead ends: 93 [2022-10-16 10:57:11,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:11,120 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:11,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 62 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-16 10:57:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 59. [2022-10-16 10:57:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 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 10:57:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-10-16 10:57:11,144 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 10 [2022-10-16 10:57:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:11,145 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-10-16 10:57:11,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10:57:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-10-16 10:57:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:57:11,149 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:11,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:11,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:57:11,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:57:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:11,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346179464] [2022-10-16 10:57:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:11,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:11,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346179464] [2022-10-16 10:57:11,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346179464] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:11,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458768778] [2022-10-16 10:57:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:11,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:11,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:11,317 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 10:57:11,330 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 10:57:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:11,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:11,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:11,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:11,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458768778] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:11,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:11,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:57:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35309724] [2022-10-16 10:57:11,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:57:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:57:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:57:11,552 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 10:57:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:11,758 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-10-16 10:57:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 10:57:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:11,761 INFO L225 Difference]: With dead ends: 112 [2022-10-16 10:57:11,762 INFO L226 Difference]: Without dead ends: 111 [2022-10-16 10:57:11,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:57:11,764 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:11,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-10-16 10:57:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2022-10-16 10:57:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 69 states have internal predecessors, (79), 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 10:57:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-10-16 10:57:11,776 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 12 [2022-10-16 10:57:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:11,776 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-10-16 10:57:11,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 10:57:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-10-16 10:57:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:57:11,778 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:11,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:11,818 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 10:57:11,993 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 10:57:11,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:57:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:11,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915680306] [2022-10-16 10:57:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:12,096 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 10:57:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:12,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915680306] [2022-10-16 10:57:12,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915680306] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:12,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236085897] [2022-10-16 10:57:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:12,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:12,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:12,099 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 10:57:12,106 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 10:57:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:12,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:12,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:12,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:12,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236085897] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:12,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:12,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453116558] [2022-10-16 10:57:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:12,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:12,233 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 10:57:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:12,331 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-10-16 10:57:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:12,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 10:57:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:12,333 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:57:12,333 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:57:12,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:57:12,335 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:12,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 172 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:57:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2022-10-16 10:57:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 68 states have internal predecessors, (76), 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 10:57:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-10-16 10:57:12,345 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 13 [2022-10-16 10:57:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:12,345 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-10-16 10:57:12,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 10:57:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-10-16 10:57:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:57:12,346 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:12,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:12,388 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 10:57:12,559 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 10:57:12,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash -825622541, now seen corresponding path program 1 times [2022-10-16 10:57:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:12,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781587618] [2022-10-16 10:57:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:12,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:12,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781587618] [2022-10-16 10:57:12,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781587618] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:12,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:12,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:12,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050257624] [2022-10-16 10:57:12,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:12,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:12,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:12,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:12,629 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 10:57:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:12,691 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-10-16 10:57:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 10:57:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:12,695 INFO L225 Difference]: With dead ends: 103 [2022-10-16 10:57:12,695 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 10:57:12,696 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 10:57:12,701 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:12,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 110 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 10:57:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2022-10-16 10:57:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 71 states have internal predecessors, (79), 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 10:57:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-10-16 10:57:12,724 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 14 [2022-10-16 10:57:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:12,725 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-10-16 10:57:12,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 10:57:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-10-16 10:57:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 10:57:12,744 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:12,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:12,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 10:57:12,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1496738415, now seen corresponding path program 1 times [2022-10-16 10:57:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:12,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247934698] [2022-10-16 10:57:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:12,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247934698] [2022-10-16 10:57:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247934698] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:12,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031424851] [2022-10-16 10:57:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:12,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:12,914 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 10:57:12,936 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 10:57:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:12,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:12,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:13,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:13,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031424851] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:13,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:13,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:57:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125064452] [2022-10-16 10:57:13,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:57:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:57:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:57:13,198 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 10:57:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:13,575 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-10-16 10:57:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:57:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 18 [2022-10-16 10:57:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:13,577 INFO L225 Difference]: With dead ends: 218 [2022-10-16 10:57:13,577 INFO L226 Difference]: Without dead ends: 176 [2022-10-16 10:57:13,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:57:13,579 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 169 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:13,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 357 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-10-16 10:57:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2022-10-16 10:57:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 105 states have internal predecessors, (126), 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 10:57:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-10-16 10:57:13,590 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 18 [2022-10-16 10:57:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:13,591 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-10-16 10:57:13,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 10:57:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-10-16 10:57:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 10:57:13,592 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:13,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:13,659 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 10:57:13,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:13,807 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -845800761, now seen corresponding path program 1 times [2022-10-16 10:57:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588371014] [2022-10-16 10:57:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588371014] [2022-10-16 10:57:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588371014] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696769447] [2022-10-16 10:57:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:14,498 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 10:57:14,500 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 10:57:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:14,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-16 10:57:14,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:14,628 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:57:14,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-10-16 10:57:14,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:14,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:57:14,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:57:14,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-10-16 10:57:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:15,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_188))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808)) is different from false [2022-10-16 10:57:15,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_188 (Array Int Int))) (or (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_188))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_186 1)))) is different from false [2022-10-16 10:57:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-16 10:57:15,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696769447] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:15,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:15,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-10-16 10:57:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870965740] [2022-10-16 10:57:15,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:15,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:57:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:57:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=183, Unknown=2, NotChecked=58, Total=306 [2022-10-16 10:57:15,155 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 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 10:57:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:15,481 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2022-10-16 10:57:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 10:57:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 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 10:57:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:15,483 INFO L225 Difference]: With dead ends: 138 [2022-10-16 10:57:15,483 INFO L226 Difference]: Without dead ends: 137 [2022-10-16 10:57:15,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=283, Unknown=2, NotChecked=74, Total=462 [2022-10-16 10:57:15,485 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:15,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 385 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 97 Unchecked, 0.2s Time] [2022-10-16 10:57:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-16 10:57:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2022-10-16 10:57:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 107 states have internal predecessors, (128), 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 10:57:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-10-16 10:57:15,521 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 19 [2022-10-16 10:57:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:15,521 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-10-16 10:57:15,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 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 10:57:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-10-16 10:57:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 10:57:15,523 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:15,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:15,566 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 10:57:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:15,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -450019723, now seen corresponding path program 1 times [2022-10-16 10:57:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:15,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286022849] [2022-10-16 10:57:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:16,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286022849] [2022-10-16 10:57:16,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286022849] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:16,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55560490] [2022-10-16 10:57:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:16,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:16,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:16,312 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 10:57:16,315 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 10:57:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:16,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:57:16,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:16,413 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:16,420 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 10:57:16,468 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 19 treesize of output 18 [2022-10-16 10:57:16,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:16,636 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 10:57:16,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:57:16,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:16,834 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:57:16,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-10-16 10:57:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:16,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:17,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55560490] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:17,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:17,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-10-16 10:57:17,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806875483] [2022-10-16 10:57:17,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:17,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 10:57:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 10:57:17,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:57:17,071 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 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 10:57:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:17,596 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2022-10-16 10:57:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 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 20 [2022-10-16 10:57:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:17,598 INFO L225 Difference]: With dead ends: 117 [2022-10-16 10:57:17,598 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 10:57:17,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:57:17,600 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:17,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 443 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 151 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-10-16 10:57:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 10:57:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-10-16 10:57:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 114 states have internal predecessors, (137), 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 10:57:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2022-10-16 10:57:17,614 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 20 [2022-10-16 10:57:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:17,614 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2022-10-16 10:57:17,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 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 10:57:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2022-10-16 10:57:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 10:57:17,616 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:17,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:17,654 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 10:57:17,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:17,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:17,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1322746103, now seen corresponding path program 1 times [2022-10-16 10:57:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:17,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823401278] [2022-10-16 10:57:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:17,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823401278] [2022-10-16 10:57:17,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823401278] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:17,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:17,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739945239] [2022-10-16 10:57:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:17,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:17,890 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 10:57:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:17,955 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2022-10-16 10:57:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:17,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-10-16 10:57:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:17,956 INFO L225 Difference]: With dead ends: 158 [2022-10-16 10:57:17,957 INFO L226 Difference]: Without dead ends: 156 [2022-10-16 10:57:17,957 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 10:57:17,958 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:17,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 112 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-10-16 10:57:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 122. [2022-10-16 10:57:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 121 states have internal predecessors, (145), 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 10:57:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-10-16 10:57:17,970 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 22 [2022-10-16 10:57:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:17,970 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-10-16 10:57:17,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 10:57:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-10-16 10:57:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:57:17,971 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:17,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:17,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 10:57:17,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1488947009, now seen corresponding path program 1 times [2022-10-16 10:57:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:17,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504059173] [2022-10-16 10:57:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:18,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504059173] [2022-10-16 10:57:18,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504059173] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:18,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817121238] [2022-10-16 10:57:18,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:18,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:18,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:18,040 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 10:57:18,048 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 10:57:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:18,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:18,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:18,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:18,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817121238] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:18,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:18,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81850240] [2022-10-16 10:57:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:18,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:18,143 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 10:57:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:18,216 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2022-10-16 10:57:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:18,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2022-10-16 10:57:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:18,218 INFO L225 Difference]: With dead ends: 156 [2022-10-16 10:57:18,218 INFO L226 Difference]: Without dead ends: 155 [2022-10-16 10:57:18,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:57:18,219 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:18,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 124 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-10-16 10:57:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-10-16 10:57:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 120 states have internal predecessors, (143), 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 10:57:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2022-10-16 10:57:18,231 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 23 [2022-10-16 10:57:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:18,231 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2022-10-16 10:57:18,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 10:57:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2022-10-16 10:57:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:57:18,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:18,233 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:18,273 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 10:57:18,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:18,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:57:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:18,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108514418] [2022-10-16 10:57:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108514418] [2022-10-16 10:57:18,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108514418] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580802819] [2022-10-16 10:57:18,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:18,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:18,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:18,590 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 10:57:18,609 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 10:57:18,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:57:18,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:18,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:57:18,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:57:18,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:57:18,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580802819] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:18,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:18,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:57:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349652745] [2022-10-16 10:57:18,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:18,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:57:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:57:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:57:18,757 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 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 10:57:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:19,016 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2022-10-16 10:57:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:19,017 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 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 24 [2022-10-16 10:57:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:19,018 INFO L225 Difference]: With dead ends: 165 [2022-10-16 10:57:19,018 INFO L226 Difference]: Without dead ends: 164 [2022-10-16 10:57:19,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:57:19,020 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 209 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:19,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 118 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-10-16 10:57:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-10-16 10:57:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 109 states have internal predecessors, (130), 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 10:57:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2022-10-16 10:57:19,031 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 24 [2022-10-16 10:57:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:19,032 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2022-10-16 10:57:19,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 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 10:57:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-10-16 10:57:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:57:19,033 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:19,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:19,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:19,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:19,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:19,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash -395689331, now seen corresponding path program 1 times [2022-10-16 10:57:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:19,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656345054] [2022-10-16 10:57:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:19,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656345054] [2022-10-16 10:57:19,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656345054] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:19,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870877128] [2022-10-16 10:57:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:19,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:19,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 10:57:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:19,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:19,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:19,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:19,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870877128] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:19,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:19,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289916611] [2022-10-16 10:57:19,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:19,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:19,579 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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 10:57:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:19,817 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2022-10-16 10:57:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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 10:57:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:19,819 INFO L225 Difference]: With dead ends: 230 [2022-10-16 10:57:19,819 INFO L226 Difference]: Without dead ends: 197 [2022-10-16 10:57:19,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:19,821 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 186 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:19,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 279 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-10-16 10:57:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 118. [2022-10-16 10:57:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 117 states have internal predecessors, (138), 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 10:57:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2022-10-16 10:57:19,833 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 25 [2022-10-16 10:57:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:19,833 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2022-10-16 10:57:19,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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 10:57:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2022-10-16 10:57:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:57:19,834 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:19,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:19,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:20,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 10:57:20,048 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1201818393, now seen corresponding path program 2 times [2022-10-16 10:57:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:20,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674942450] [2022-10-16 10:57:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:20,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674942450] [2022-10-16 10:57:20,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674942450] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191544565] [2022-10-16 10:57:20,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:20,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:20,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:20,255 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:20,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 10:57:20,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:57:20,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:57:20,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:20,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:20,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191544565] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:20,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:20,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:57:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351032031] [2022-10-16 10:57:20,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:20,424 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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 10:57:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:20,865 INFO L93 Difference]: Finished difference Result 316 states and 371 transitions. [2022-10-16 10:57:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:57:20,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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 26 [2022-10-16 10:57:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:20,868 INFO L225 Difference]: With dead ends: 316 [2022-10-16 10:57:20,868 INFO L226 Difference]: Without dead ends: 270 [2022-10-16 10:57:20,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:57:20,872 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 360 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:20,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 206 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-10-16 10:57:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 131. [2022-10-16 10:57:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 120 states have (on average 1.275) internal successors, (153), 130 states have internal predecessors, (153), 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 10:57:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-10-16 10:57:20,897 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 26 [2022-10-16 10:57:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:20,898 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-10-16 10:57:20,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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 10:57:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-10-16 10:57:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 10:57:20,899 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:20,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:20,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:21,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 10:57:21,113 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1994597725, now seen corresponding path program 1 times [2022-10-16 10:57:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:21,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620989517] [2022-10-16 10:57:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:22,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620989517] [2022-10-16 10:57:22,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620989517] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:22,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908768275] [2022-10-16 10:57:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:22,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:22,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:22,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:22,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 10:57:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:22,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-16 10:57:22,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:22,306 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:22,316 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 18 treesize of output 16 [2022-10-16 10:57:22,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:22,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:57:22,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:22,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:22,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:57:22,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:22,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:22,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-10-16 10:57:23,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:23,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:23,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-10-16 10:57:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:23,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:24,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908768275] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:24,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:24,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-10-16 10:57:24,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458224881] [2022-10-16 10:57:24,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:24,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:57:24,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:57:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:57:24,027 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 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 10:57:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:24,835 INFO L93 Difference]: Finished difference Result 150 states and 177 transitions. [2022-10-16 10:57:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 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 27 [2022-10-16 10:57:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:24,836 INFO L225 Difference]: With dead ends: 150 [2022-10-16 10:57:24,837 INFO L226 Difference]: Without dead ends: 148 [2022-10-16 10:57:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:57:24,838 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 126 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:24,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 407 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 130 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-10-16 10:57:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-16 10:57:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2022-10-16 10:57:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 120 states have (on average 1.275) internal successors, (153), 130 states have internal predecessors, (153), 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 10:57:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-10-16 10:57:24,857 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 27 [2022-10-16 10:57:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:24,857 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-10-16 10:57:24,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 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 10:57:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-10-16 10:57:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:57:24,858 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:24,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:24,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:25,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 10:57:25,071 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1702987445, now seen corresponding path program 1 times [2022-10-16 10:57:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:25,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550190631] [2022-10-16 10:57:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:26,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550190631] [2022-10-16 10:57:26,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550190631] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:26,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608954110] [2022-10-16 10:57:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:26,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:26,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:26,031 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:26,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 10:57:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:26,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 10:57:26,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:26,175 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:26,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:26,256 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 19 treesize of output 18 [2022-10-16 10:57:26,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:26,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:57:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:26,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:27,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_480 Int)) (or (< (+ v_ArrVal_480 9223372036854775808) 0) (< 0 (+ v_ArrVal_480 9223372036854775809 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_480)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2022-10-16 10:57:27,667 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 80 treesize of output 76 [2022-10-16 10:57:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-10-16 10:57:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608954110] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:27,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:27,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-10-16 10:57:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629537472] [2022-10-16 10:57:27,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:27,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:57:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:57:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=377, Unknown=1, NotChecked=40, Total=506 [2022-10-16 10:57:27,757 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 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 10:57:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:28,544 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2022-10-16 10:57:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:57:28,545 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 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 28 [2022-10-16 10:57:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:28,546 INFO L225 Difference]: With dead ends: 228 [2022-10-16 10:57:28,546 INFO L226 Difference]: Without dead ends: 227 [2022-10-16 10:57:28,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=249, Invalid=944, Unknown=1, NotChecked=66, Total=1260 [2022-10-16 10:57:28,549 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 462 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:28,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 315 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 204 Invalid, 0 Unknown, 58 Unchecked, 0.2s Time] [2022-10-16 10:57:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-10-16 10:57:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 135. [2022-10-16 10:57:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 124 states have (on average 1.282258064516129) internal successors, (159), 134 states have internal predecessors, (159), 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 10:57:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2022-10-16 10:57:28,569 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 28 [2022-10-16 10:57:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:28,569 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2022-10-16 10:57:28,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 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 10:57:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2022-10-16 10:57:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:57:28,572 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:28,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:28,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:28,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 10:57:28,787 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1409495825, now seen corresponding path program 2 times [2022-10-16 10:57:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727369349] [2022-10-16 10:57:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:28,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727369349] [2022-10-16 10:57:28,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727369349] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869977991] [2022-10-16 10:57:28,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:28,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:28,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:28,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 10:57:28,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:28,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:28,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:28,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:29,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:29,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869977991] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:29,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:29,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474700253] [2022-10-16 10:57:29,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:29,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:29,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:29,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:29,152 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 10:57:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:29,547 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2022-10-16 10:57:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 29 [2022-10-16 10:57:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:29,548 INFO L225 Difference]: With dead ends: 252 [2022-10-16 10:57:29,549 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 10:57:29,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:57:29,556 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 220 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:29,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 415 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 10:57:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2022-10-16 10:57:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 134 states have internal predecessors, (157), 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 10:57:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2022-10-16 10:57:29,579 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 29 [2022-10-16 10:57:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:29,580 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2022-10-16 10:57:29,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 10:57:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2022-10-16 10:57:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:57:29,581 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:29,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:29,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:29,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 10:57:29,794 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash 188398583, now seen corresponding path program 1 times [2022-10-16 10:57:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:29,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467282109] [2022-10-16 10:57:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:57:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467282109] [2022-10-16 10:57:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467282109] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:29,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:29,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442504627] [2022-10-16 10:57:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:29,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:29,849 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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 10:57:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:29,918 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2022-10-16 10:57:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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 30 [2022-10-16 10:57:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:29,920 INFO L225 Difference]: With dead ends: 163 [2022-10-16 10:57:29,920 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:57:29,921 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 10:57:29,921 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:29,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:57:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 141. [2022-10-16 10:57:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 140 states have internal predecessors, (163), 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 10:57:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2022-10-16 10:57:29,942 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 30 [2022-10-16 10:57:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2022-10-16 10:57:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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 10:57:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2022-10-16 10:57:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:57:29,943 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:29,943 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:29,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 10:57:29,943 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -939950877, now seen corresponding path program 1 times [2022-10-16 10:57:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770880533] [2022-10-16 10:57:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770880533] [2022-10-16 10:57:30,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770880533] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492514245] [2022-10-16 10:57:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:30,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:30,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:30,072 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:30,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 10:57:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:30,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:30,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:30,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:30,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492514245] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:30,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:30,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102748434] [2022-10-16 10:57:30,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:30,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:30,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:30,329 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 10:57:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:30,569 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2022-10-16 10:57:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:30,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 33 [2022-10-16 10:57:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:30,571 INFO L225 Difference]: With dead ends: 211 [2022-10-16 10:57:30,571 INFO L226 Difference]: Without dead ends: 190 [2022-10-16 10:57:30,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:30,572 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:30,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 202 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-16 10:57:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2022-10-16 10:57:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 148 states have internal predecessors, (171), 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 10:57:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2022-10-16 10:57:30,593 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2022-10-16 10:57:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:30,593 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2022-10-16 10:57:30,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 10:57:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2022-10-16 10:57:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:57:30,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:30,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:30,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:30,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:30,809 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1206436117, now seen corresponding path program 3 times [2022-10-16 10:57:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:30,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141717300] [2022-10-16 10:57:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141717300] [2022-10-16 10:57:32,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141717300] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:32,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123179847] [2022-10-16 10:57:32,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:57:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:32,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:32,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 10:57:32,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:57:32,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:32,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 40 conjunts are in the unsatisfiable core [2022-10-16 10:57:32,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:32,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,143 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 18 treesize of output 16 [2022-10-16 10:57:32,154 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:32,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:57:32,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,404 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 10:57:32,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 10:57:32,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:57:32,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:32,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:57:33,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:33,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:33,392 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:57:33,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-10-16 10:57:33,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:33,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:33,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:33,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-10-16 10:57:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:33,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:36,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_94| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_630))))) is different from false [2022-10-16 10:57:36,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_94| 1)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_630))))) is different from false [2022-10-16 10:57:36,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_630) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_94|))))) is different from false [2022-10-16 10:57:36,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_94|) (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_630))))) is different from false [2022-10-16 10:57:37,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_630) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|) (< |v_ULTIMATE.start_main_~i~0#1_100| |v_ULTIMATE.start_main_~i~0#1_94|))))) is different from false [2022-10-16 10:57:37,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|) (< |v_ULTIMATE.start_main_~i~0#1_100| |v_ULTIMATE.start_main_~i~0#1_94|) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_630))))) is different from false [2022-10-16 10:57:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-10-16 10:57:37,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123179847] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:37,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:37,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 44 [2022-10-16 10:57:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437269084] [2022-10-16 10:57:37,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:37,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 10:57:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:37,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 10:57:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1332, Unknown=11, NotChecked=474, Total=1980 [2022-10-16 10:57:37,214 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 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 10:57:38,603 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= .cse1 0) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_630 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_630) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|) (< |v_ULTIMATE.start_main_~i~0#1_100| |v_ULTIMATE.start_main_~i~0#1_94|))))) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_94|) (< (+ v_ArrVal_630 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_630))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:57:39,792 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_628))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_94| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ v_ArrVal_630 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_630))))) (forall ((v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_630 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_630)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (not (< |v_ULTIMATE.start_main_~i~0#1_94| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_630))))) is different from false [2022-10-16 10:57:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:41,841 INFO L93 Difference]: Finished difference Result 180 states and 211 transitions. [2022-10-16 10:57:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-16 10:57:41,842 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 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 33 [2022-10-16 10:57:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:41,843 INFO L225 Difference]: With dead ends: 180 [2022-10-16 10:57:41,843 INFO L226 Difference]: Without dead ends: 179 [2022-10-16 10:57:41,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=332, Invalid=2766, Unknown=14, NotChecked=920, Total=4032 [2022-10-16 10:57:41,846 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:41,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 352 Unchecked, 0.1s Time] [2022-10-16 10:57:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-16 10:57:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-10-16 10:57:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 178 states have internal predecessors, (208), 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 10:57:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2022-10-16 10:57:41,871 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 33 [2022-10-16 10:57:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:41,871 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2022-10-16 10:57:41,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 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 10:57:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2022-10-16 10:57:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:57:41,872 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:41,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:41,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:42,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:42,086 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1255185945, now seen corresponding path program 1 times [2022-10-16 10:57:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899669634] [2022-10-16 10:57:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899669634] [2022-10-16 10:57:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899669634] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071264676] [2022-10-16 10:57:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:42,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:42,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:42,746 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:42,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 10:57:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:42,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:57:42,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:42,846 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:57:42,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-10-16 10:57:42,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:57:42,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:57:43,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:57:43,093 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 21 treesize of output 20 [2022-10-16 10:57:43,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:57:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:43,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:44,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (< 0 (+ v_ArrVal_680 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_680)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775809)) (< (+ v_ArrVal_680 9223372036854775808) 0))) is different from false [2022-10-16 10:57:45,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (< 0 (+ v_ArrVal_680 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_679))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_680))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ v_ArrVal_680 9223372036854775808) 0))) is different from false [2022-10-16 10:57:45,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:45,196 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 50 treesize of output 39 [2022-10-16 10:57:45,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:45,209 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 362 treesize of output 352 [2022-10-16 10:57:45,223 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 406 treesize of output 374 [2022-10-16 10:57:45,249 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 226 treesize of output 210 [2022-10-16 10:57:45,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:45,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 282 [2022-10-16 10:57:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-10-16 10:57:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071264676] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:45,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:45,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-10-16 10:57:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379610638] [2022-10-16 10:57:45,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:45,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 10:57:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 10:57:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=650, Unknown=2, NotChecked=106, Total=870 [2022-10-16 10:57:45,604 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 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 10:57:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:46,275 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2022-10-16 10:57:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 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 34 [2022-10-16 10:57:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:46,278 INFO L225 Difference]: With dead ends: 245 [2022-10-16 10:57:46,278 INFO L226 Difference]: Without dead ends: 244 [2022-10-16 10:57:46,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=160, Invalid=902, Unknown=2, NotChecked=126, Total=1190 [2022-10-16 10:57:46,280 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 203 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:46,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 693 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 522 Invalid, 0 Unknown, 210 Unchecked, 0.4s Time] [2022-10-16 10:57:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-16 10:57:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 181. [2022-10-16 10:57:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 180 states have internal predecessors, (210), 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 10:57:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2022-10-16 10:57:46,316 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 34 [2022-10-16 10:57:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:46,316 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2022-10-16 10:57:46,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 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 10:57:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2022-10-16 10:57:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:57:46,317 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:46,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:46,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:46,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:46,532 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash 652120041, now seen corresponding path program 1 times [2022-10-16 10:57:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538406945] [2022-10-16 10:57:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:46,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:46,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538406945] [2022-10-16 10:57:46,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538406945] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:46,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849584571] [2022-10-16 10:57:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:46,630 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:46,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:57:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:46,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:46,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:46,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:46,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849584571] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:46,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:46,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:57:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921802560] [2022-10-16 10:57:46,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:46,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:57:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:57:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:57:46,784 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 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 10:57:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:46,982 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2022-10-16 10:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:46,985 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 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 36 [2022-10-16 10:57:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:46,987 INFO L225 Difference]: With dead ends: 239 [2022-10-16 10:57:46,987 INFO L226 Difference]: Without dead ends: 238 [2022-10-16 10:57:46,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:57:46,990 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:46,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 261 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-10-16 10:57:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 204. [2022-10-16 10:57:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 203 states have internal predecessors, (245), 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 10:57:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 245 transitions. [2022-10-16 10:57:47,033 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 245 transitions. Word has length 36 [2022-10-16 10:57:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:47,033 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 245 transitions. [2022-10-16 10:57:47,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 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 10:57:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 245 transitions. [2022-10-16 10:57:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 10:57:47,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:47,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:47,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:47,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 10:57:47,246 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1259115111, now seen corresponding path program 1 times [2022-10-16 10:57:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:47,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821828578] [2022-10-16 10:57:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821828578] [2022-10-16 10:57:47,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821828578] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:47,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480234995] [2022-10-16 10:57:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:47,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:47,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:47,344 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:47,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 10:57:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:47,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:47,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:47,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:47,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480234995] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:47,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:47,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358728530] [2022-10-16 10:57:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:47,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:47,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:47,465 INFO L87 Difference]: Start difference. First operand 204 states and 245 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 10:57:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:47,575 INFO L93 Difference]: Finished difference Result 224 states and 266 transitions. [2022-10-16 10:57:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 37 [2022-10-16 10:57:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:47,578 INFO L225 Difference]: With dead ends: 224 [2022-10-16 10:57:47,578 INFO L226 Difference]: Without dead ends: 223 [2022-10-16 10:57:47,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:57:47,579 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:47,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-10-16 10:57:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2022-10-16 10:57:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 193 states have (on average 1.238341968911917) internal successors, (239), 202 states have internal predecessors, (239), 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 10:57:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2022-10-16 10:57:47,614 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 37 [2022-10-16 10:57:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:47,615 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2022-10-16 10:57:47,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 10:57:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2022-10-16 10:57:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 10:57:47,616 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:47,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:47,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:47,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:47,832 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash 359836473, now seen corresponding path program 1 times [2022-10-16 10:57:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:47,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199012972] [2022-10-16 10:57:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:57:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199012972] [2022-10-16 10:57:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199012972] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:47,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298552661] [2022-10-16 10:57:47,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:47,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:47,913 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 10:57:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:47,989 INFO L93 Difference]: Finished difference Result 223 states and 260 transitions. [2022-10-16 10:57:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:47,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-10-16 10:57:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:47,991 INFO L225 Difference]: With dead ends: 223 [2022-10-16 10:57:47,991 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 10:57:47,992 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 10:57:47,993 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:47,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 100 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 10:57:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-10-16 10:57:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 209 states have (on average 1.2248803827751196) internal successors, (256), 218 states have internal predecessors, (256), 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 10:57:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 256 transitions. [2022-10-16 10:57:48,024 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 256 transitions. Word has length 40 [2022-10-16 10:57:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:48,024 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 256 transitions. [2022-10-16 10:57:48,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 10:57:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 256 transitions. [2022-10-16 10:57:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 10:57:48,025 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:48,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:48,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 10:57:48,026 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:48,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1946178913, now seen corresponding path program 2 times [2022-10-16 10:57:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:48,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501460164] [2022-10-16 10:57:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501460164] [2022-10-16 10:57:48,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501460164] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:48,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218840631] [2022-10-16 10:57:48,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:48,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:48,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:48,233 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:48,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 10:57:48,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:48,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:48,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:57:48,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:48,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:48,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218840631] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:48,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:48,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:57:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100182301] [2022-10-16 10:57:48,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:57:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:48,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:57:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:48,623 INFO L87 Difference]: Start difference. First operand 219 states and 256 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 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 10:57:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:49,048 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2022-10-16 10:57:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:57:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 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 40 [2022-10-16 10:57:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:49,057 INFO L225 Difference]: With dead ends: 271 [2022-10-16 10:57:49,057 INFO L226 Difference]: Without dead ends: 216 [2022-10-16 10:57:49,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:57:49,058 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 288 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:49,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 378 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:57:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-10-16 10:57:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 203. [2022-10-16 10:57:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 202 states have internal predecessors, (231), 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 10:57:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 231 transitions. [2022-10-16 10:57:49,095 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 231 transitions. Word has length 40 [2022-10-16 10:57:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:49,096 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 231 transitions. [2022-10-16 10:57:49,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 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 10:57:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 231 transitions. [2022-10-16 10:57:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:57:49,097 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:49,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:49,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:49,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:49,312 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1014297451, now seen corresponding path program 2 times [2022-10-16 10:57:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:49,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373476972] [2022-10-16 10:57:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:57:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373476972] [2022-10-16 10:57:49,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373476972] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:49,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868752984] [2022-10-16 10:57:49,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:49,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:49,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:49,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 10:57:49,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:49,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:49,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:49,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:57:49,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:57:49,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868752984] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:49,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:49,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536907282] [2022-10-16 10:57:49,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:49,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:49,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:49,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:49,713 INFO L87 Difference]: Start difference. First operand 203 states and 231 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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 10:57:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:50,068 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-10-16 10:57:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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) Word has length 41 [2022-10-16 10:57:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:50,071 INFO L225 Difference]: With dead ends: 286 [2022-10-16 10:57:50,071 INFO L226 Difference]: Without dead ends: 219 [2022-10-16 10:57:50,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:57:50,075 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 192 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:50,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 281 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-10-16 10:57:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2022-10-16 10:57:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.1871657754010696) internal successors, (222), 196 states have internal predecessors, (222), 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 10:57:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions. [2022-10-16 10:57:50,104 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 41 [2022-10-16 10:57:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:50,104 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions. [2022-10-16 10:57:50,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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 10:57:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions. [2022-10-16 10:57:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:57:50,105 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:50,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:50,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:50,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:50,319 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 201956779, now seen corresponding path program 2 times [2022-10-16 10:57:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:50,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121407891] [2022-10-16 10:57:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121407891] [2022-10-16 10:57:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121407891] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125060909] [2022-10-16 10:57:52,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:52,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:52,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:52,294 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:52,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 10:57:52,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:52,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:52,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:57:52,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:52,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:52,428 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 18 treesize of output 16 [2022-10-16 10:57:52,440 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:52,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:52,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:57:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:52,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:52,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:57:53,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-10-16 10:57:53,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 10:57:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:53,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-10-16 10:57:54,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-10-16 10:57:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2022-10-16 10:57:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:54,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:04,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_136|)) (forall ((v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_946 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_946))))))) is different from false [2022-10-16 10:58:06,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_136| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_946 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_946))))) is different from false [2022-10-16 10:58:21,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_940) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_940 1)) (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_946) (< (+ v_ArrVal_946 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_943) (< |v_ULTIMATE.start_main_~i~0#1_136| 1))))) is different from false [2022-10-16 10:59:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2022-10-16 10:59:27,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125060909] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:27,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:27,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 56 [2022-10-16 10:59:27,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133254858] [2022-10-16 10:59:27,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:27,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:59:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:27,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:59:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2534, Unknown=33, NotChecked=318, Total=3192 [2022-10-16 10:59:27,539 INFO L87 Difference]: Start difference. First operand 197 states and 222 transitions. Second operand has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 57 states have internal predecessors, (114), 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 10:59:34,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_940) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_940 1)) (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946) (< (+ v_ArrVal_946 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_943) (< |v_ULTIMATE.start_main_~i~0#1_136| 1))))) (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_938 Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_938)))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_940) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942))))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_940 1)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_943 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946) (< (+ v_ArrVal_946 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (not (<= v_ArrVal_938 1)) (< |v_ULTIMATE.start_main_~i~0#1_136| 1))))))) is different from false [2022-10-16 10:59:36,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_938 Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |c_ULTIMATE.start_main_#t~post7#1|)) v_ArrVal_938)))) (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_940) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_940 1)) (< (+ v_ArrVal_946 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946) (not (<= v_ArrVal_938 1)) (< |v_ULTIMATE.start_main_~i~0#1_136| 1) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943))))) (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_940) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_940 1)) (< (+ v_ArrVal_943 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946) (< (+ v_ArrVal_946 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_943) (< |v_ULTIMATE.start_main_~i~0#1_136| 1))))))) is different from false [2022-10-16 10:59:38,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select .cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 0) 1) (= .cse1 0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse2) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse3 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse3 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_136| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_946 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946)))))))) is different from false [2022-10-16 10:59:40,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (= .cse1 0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 0 |c_ULTIMATE.start_main_#t~post8#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse2) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (= (select .cse3 0) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_136|)) (forall ((v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_946 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946))))))))) is different from false [2022-10-16 11:00:11,315 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:00:13,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (= .cse1 0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse2) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (= (select .cse3 0) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_136| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_946 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946))))))) is different from false [2022-10-16 11:00:15,467 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (= .cse1 0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse2) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (= (select .cse3 0) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_136|)) (forall ((v_ArrVal_946 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_942)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_943) (< (+ v_ArrVal_946 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_946)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_943 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_946))))))))) is different from false [2022-10-16 11:00:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:17,417 INFO L93 Difference]: Finished difference Result 246 states and 276 transitions. [2022-10-16 11:00:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 11:00:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 57 states have internal predecessors, (114), 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 41 [2022-10-16 11:00:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:17,418 INFO L225 Difference]: With dead ends: 246 [2022-10-16 11:00:17,418 INFO L226 Difference]: Without dead ends: 245 [2022-10-16 11:00:17,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 143.0s TimeCoverageRelationStatistics Valid=680, Invalid=4856, Unknown=50, NotChecked=1386, Total=6972 [2022-10-16 11:00:17,421 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 969 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:17,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 911 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 326 Invalid, 0 Unknown, 969 Unchecked, 0.4s Time] [2022-10-16 11:00:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-10-16 11:00:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2022-10-16 11:00:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 231 states have (on average 1.1688311688311688) internal successors, (270), 240 states have internal predecessors, (270), 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 11:00:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 270 transitions. [2022-10-16 11:00:17,463 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 270 transitions. Word has length 41 [2022-10-16 11:00:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:17,464 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 270 transitions. [2022-10-16 11:00:17,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 57 states have internal predecessors, (114), 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 11:00:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 270 transitions. [2022-10-16 11:00:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 11:00:17,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:17,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:17,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 11:00:17,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 11:00:17,674 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -803522531, now seen corresponding path program 4 times [2022-10-16 11:00:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:17,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152094159] [2022-10-16 11:00:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 11:00:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:17,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152094159] [2022-10-16 11:00:17,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152094159] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:17,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928899448] [2022-10-16 11:00:17,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 11:00:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:17,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:17,955 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:17,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 11:00:18,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 11:00:18,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:00:18,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 11:00:18,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:00:18,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:00:18,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928899448] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:18,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:18,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 25 [2022-10-16 11:00:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744687039] [2022-10-16 11:00:18,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:18,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 11:00:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 11:00:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-10-16 11:00:18,493 INFO L87 Difference]: Start difference. First operand 241 states and 270 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 11:00:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:19,638 INFO L93 Difference]: Finished difference Result 391 states and 435 transitions. [2022-10-16 11:00:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 11:00:19,639 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 41 [2022-10-16 11:00:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:19,640 INFO L225 Difference]: With dead ends: 391 [2022-10-16 11:00:19,640 INFO L226 Difference]: Without dead ends: 295 [2022-10-16 11:00:19,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=1640, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 11:00:19,642 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 250 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:19,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 807 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 11:00:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-10-16 11:00:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 209. [2022-10-16 11:00:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.170854271356784) internal successors, (233), 208 states have internal predecessors, (233), 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 11:00:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 233 transitions. [2022-10-16 11:00:19,671 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 233 transitions. Word has length 41 [2022-10-16 11:00:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:19,671 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 233 transitions. [2022-10-16 11:00:19,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 11:00:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 233 transitions. [2022-10-16 11:00:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 11:00:19,673 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:19,673 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:19,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-10-16 11:00:19,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 11:00:19,887 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1921778353, now seen corresponding path program 3 times [2022-10-16 11:00:19,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:19,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741114487] [2022-10-16 11:00:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 11:00:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:21,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741114487] [2022-10-16 11:00:21,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741114487] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:21,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409484772] [2022-10-16 11:00:21,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 11:00:21,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:21,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:21,284 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:21,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 11:00:21,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 11:00:21,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:00:21,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-16 11:00:21,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:21,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:21,410 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 11:00:21,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-10-16 11:00:21,585 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 15 treesize of output 11 [2022-10-16 11:00:21,792 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 11:00:21,792 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 1 case distinctions, treesize of input 23 treesize of output 28 [2022-10-16 11:00:22,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:22,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-10-16 11:00:22,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:22,701 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 11:00:22,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2022-10-16 11:00:23,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:23,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2022-10-16 11:00:23,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:23,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:23,900 INFO L356 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-10-16 11:00:23,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 38 [2022-10-16 11:00:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 11:00:23,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:24,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1057 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1055)))) (or (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_152| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_152| c_~N~0)) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1055))))) is different from false [2022-10-16 11:00:24,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:24,985 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2022-10-16 11:00:25,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< 9223372036854775807 (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_152| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_152| c_~N~0)) (< (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808)))) is different from false [2022-10-16 11:00:25,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< 9223372036854775807 (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_152| 1)) (< |v_ULTIMATE.start_main_~i~0#1_152| 1) (< (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808)))) is different from false [2022-10-16 11:00:25,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< 9223372036854775807 (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |c_ULTIMATE.start_main_#t~post8#1| |v_ULTIMATE.start_main_~i~0#1_152|) (< |v_ULTIMATE.start_main_~i~0#1_152| 1) (< (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808)))) is different from false [2022-10-16 11:00:25,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< 9223372036854775807 (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_152| 1) (< (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_152|)))) is different from false [2022-10-16 11:00:25,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1052)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= v_ArrVal_1052 1)) (< |v_ULTIMATE.start_main_~i~0#1_152| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_152|)))) is different from false [2022-10-16 11:00:25,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_158| Int) (v_ArrVal_1052 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_158| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1052)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_158|) (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_1052 1)) (< |v_ULTIMATE.start_main_~i~0#1_158| |v_ULTIMATE.start_main_~i~0#1_152|) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_152| 1)))) is different from false [2022-10-16 11:00:25,500 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-10-16 11:00:25,501 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 2 case distinctions, treesize of input 101 treesize of output 77 [2022-10-16 11:00:25,568 INFO L356 Elim1Store]: treesize reduction 20, result has 70.1 percent of original size [2022-10-16 11:00:25,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 240 treesize of output 250 [2022-10-16 11:00:25,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:25,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 142 [2022-10-16 11:00:25,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:00:25,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:25,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 149 [2022-10-16 11:00:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 14 not checked. [2022-10-16 11:00:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409484772] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:26,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 50 [2022-10-16 11:00:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197776248] [2022-10-16 11:00:26,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-10-16 11:00:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-10-16 11:00:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1699, Unknown=15, NotChecked=630, Total=2550 [2022-10-16 11:00:26,455 INFO L87 Difference]: Start difference. First operand 209 states and 233 transitions. Second operand has 51 states, 50 states have (on average 2.26) internal successors, (113), 51 states have internal predecessors, (113), 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 11:00:26,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (and (or (<= 1 (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= .cse1 0)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 .cse2) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse2 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_158| Int) (v_ArrVal_1052 Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_158| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1052)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_158|) (< (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1057))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_1052 1)) (< |v_ULTIMATE.start_main_~i~0#1_158| |v_ULTIMATE.start_main_~i~0#1_152|) (< 9223372036854775807 (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_152| 1)))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= .cse2 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 11:00:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:29,084 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2022-10-16 11:00:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-16 11:00:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.26) internal successors, (113), 51 states have internal predecessors, (113), 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 47 [2022-10-16 11:00:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:29,086 INFO L225 Difference]: With dead ends: 246 [2022-10-16 11:00:29,087 INFO L226 Difference]: Without dead ends: 245 [2022-10-16 11:00:29,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=382, Invalid=3047, Unknown=25, NotChecked=968, Total=4422 [2022-10-16 11:00:29,089 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:29,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 770 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 401 Unchecked, 0.2s Time] [2022-10-16 11:00:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-10-16 11:00:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2022-10-16 11:00:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 234 states have (on average 1.1837606837606838) internal successors, (277), 243 states have internal predecessors, (277), 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 11:00:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2022-10-16 11:00:29,129 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 47 [2022-10-16 11:00:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:29,129 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2022-10-16 11:00:29,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.26) internal successors, (113), 51 states have internal predecessors, (113), 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 11:00:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2022-10-16 11:00:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 11:00:29,130 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:29,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:29,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 11:00:29,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 11:00:29,339 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash 189048547, now seen corresponding path program 5 times [2022-10-16 11:00:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:29,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143243157] [2022-10-16 11:00:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:00:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143243157] [2022-10-16 11:00:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143243157] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142917909] [2022-10-16 11:00:31,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 11:00:31,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:31,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:31,645 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:31,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 11:00:31,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 11:00:31,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:00:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 76 conjunts are in the unsatisfiable core [2022-10-16 11:00:31,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:31,799 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 11:00:31,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:31,817 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 11:00:31,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-10-16 11:00:31,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:00:32,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:32,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 11:00:32,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:32,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:32,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 11:00:32,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:32,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 11:00:33,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:33,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 11:00:33,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:33,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:33,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:33,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-10-16 11:00:34,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:00:34,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-10-16 11:00:34,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:34,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:00:34,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2022-10-16 11:00:35,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:35,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 24 [2022-10-16 11:00:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:00:35,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:38,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:38,108 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 81 [2022-10-16 11:00:38,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (not (= (select v_arrayElimArr_4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129))))) is different from false [2022-10-16 11:00:38,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (not (= (select v_arrayElimArr_4 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129))))) is different from false [2022-10-16 11:00:38,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (not (= (select v_arrayElimArr_4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129))))) is different from false [2022-10-16 11:00:38,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1121)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1121 1)) (< (+ v_ArrVal_1129 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ v_ArrVal_1128 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_1129) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |c_ULTIMATE.start_main_#t~post7#1|)) v_ArrVal_1121)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1121 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (< (+ v_ArrVal_1128 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_1129) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1121)) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (not (<= v_ArrVal_1121 1)) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1121))) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1121 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_#t~post7#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) 1) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) v_ArrVal_1121))) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1121 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1129) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1128) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 16 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1121))) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1121 1)) (< (+ v_ArrVal_1129 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) v_ArrVal_1129) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))))) is different from false [2022-10-16 11:00:38,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1129 Int) (v_ArrVal_1117 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1117) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 16 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1121))) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1121 1)) (< (+ v_ArrVal_1128 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_1129) (< (+ v_ArrVal_1129 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1129)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1128) (not (= (select v_arrayElimArr_4 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)) (not (<= v_ArrVal_1117 1)))))) is different from false [2022-10-16 11:00:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2022-10-16 11:00:38,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142917909] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:38,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:38,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 26] total 70 [2022-10-16 11:00:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641276881] [2022-10-16 11:00:38,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:38,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-10-16 11:00:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-10-16 11:00:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3239, Unknown=11, NotChecked=1386, Total=4970 [2022-10-16 11:00:38,886 INFO L87 Difference]: Start difference. First operand 244 states and 277 transitions. Second operand has 71 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 71 states have internal predecessors, (129), 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 11:00:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:44,102 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2022-10-16 11:00:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-16 11:00:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 71 states have internal predecessors, (129), 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 47 [2022-10-16 11:00:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:44,104 INFO L225 Difference]: With dead ends: 245 [2022-10-16 11:00:44,104 INFO L226 Difference]: Without dead ends: 244 [2022-10-16 11:00:44,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=737, Invalid=6778, Unknown=11, NotChecked=1980, Total=9506 [2022-10-16 11:00:44,108 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 76 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1407 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:44,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1424 Invalid, 2421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 961 Invalid, 0 Unknown, 1407 Unchecked, 0.9s Time] [2022-10-16 11:00:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-16 11:00:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2022-10-16 11:00:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 221 states have (on average 1.1809954751131222) internal successors, (261), 230 states have internal predecessors, (261), 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 11:00:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 261 transitions. [2022-10-16 11:00:44,143 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 261 transitions. Word has length 47 [2022-10-16 11:00:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:44,143 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 261 transitions. [2022-10-16 11:00:44,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 71 states have internal predecessors, (129), 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 11:00:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 261 transitions. [2022-10-16 11:00:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 11:00:44,145 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:44,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:44,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 11:00:44,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:44,358 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1245349172, now seen corresponding path program 1 times [2022-10-16 11:00:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263940586] [2022-10-16 11:00:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:00:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:44,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263940586] [2022-10-16 11:00:44,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263940586] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:44,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200395179] [2022-10-16 11:00:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:44,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:44,452 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:44,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 11:00:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:44,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 11:00:44,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 11:00:44,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 11:00:44,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200395179] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:44,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:44,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 11:00:44,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291382240] [2022-10-16 11:00:44,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:44,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 11:00:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 11:00:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 11:00:44,855 INFO L87 Difference]: Start difference. First operand 231 states and 261 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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 11:00:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:45,216 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2022-10-16 11:00:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 11:00:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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 48 [2022-10-16 11:00:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:45,218 INFO L225 Difference]: With dead ends: 271 [2022-10-16 11:00:45,218 INFO L226 Difference]: Without dead ends: 229 [2022-10-16 11:00:45,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-10-16 11:00:45,220 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 114 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:45,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 263 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 11:00:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-10-16 11:00:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2022-10-16 11:00:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.187793427230047) internal successors, (253), 222 states have internal predecessors, (253), 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 11:00:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-10-16 11:00:45,251 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 48 [2022-10-16 11:00:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:45,251 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-10-16 11:00:45,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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 11:00:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-10-16 11:00:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 11:00:45,252 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:45,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:45,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-10-16 11:00:45,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:45,453 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash -554413087, now seen corresponding path program 1 times [2022-10-16 11:00:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:45,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837281704] [2022-10-16 11:00:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 11:00:46,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:46,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837281704] [2022-10-16 11:00:46,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837281704] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:46,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107477936] [2022-10-16 11:00:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:46,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:46,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:46,229 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:46,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-10-16 11:00:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:46,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 11:00:46,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:46,347 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 11:00:46,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-10-16 11:00:46,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 11:00:46,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 11:00:46,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 11:00:47,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-16 11:00:47,675 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 11:00:47,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-10-16 11:00:48,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2022-10-16 11:00:48,114 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 11:00:48,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2022-10-16 11:00:48,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 11:00:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:00:48,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:48,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1231 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2022-10-16 11:00:48,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1231 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2022-10-16 11:00:48,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (v_ArrVal_1231 (Array Int Int))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|) v_ArrVal_1230)))) is different from false [2022-10-16 11:00:48,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1230 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 11:00:48,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_1230 (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post9#1| 8) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< 0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2022-10-16 11:00:48,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1230 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 11:00:48,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1228 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1230 (+ v_ArrVal_1228 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ 9223372036854775808 v_ArrVal_1228) 0)))) is different from false [2022-10-16 11:00:48,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1228 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1230 (+ v_ArrVal_1228 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ 9223372036854775808 v_ArrVal_1228) 0)))) is different from false [2022-10-16 11:00:48,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1228 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_1225)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_1230 (+ v_ArrVal_1228 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4))))) (< (+ 9223372036854775808 v_ArrVal_1228) 0) (not (<= 1 v_ArrVal_1225)))))) is different from false [2022-10-16 11:00:48,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1228 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4) v_ArrVal_1225)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4))))) (< (+ 9223372036854775808 v_ArrVal_1228) 0) (not (<= 1 v_ArrVal_1225)) (< v_ArrVal_1230 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1228)))))) is different from false [2022-10-16 11:00:48,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1228 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_1225)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_1230 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1228)) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ 9223372036854775808 v_ArrVal_1228) 0) (not (<= 1 v_ArrVal_1225)))))) is different from false [2022-10-16 11:00:48,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:48,993 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 87 [2022-10-16 11:00:49,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1228 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_5))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_1230 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1228)) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4))))) (< (+ 9223372036854775808 v_ArrVal_1228) 0) (not (<= 1 (select v_arrayElimArr_5 (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)))))))) is different from false [2022-10-16 11:00:49,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1230 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1228 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_5))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 4))) (or (< v_ArrVal_1230 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1228)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1228)) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1230)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1231))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= 1 (select v_arrayElimArr_5 .cse3))) (< (+ 9223372036854775808 v_ArrVal_1228) 0))))) is different from false [2022-10-16 11:00:49,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:49,212 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 148 treesize of output 88 [2022-10-16 11:00:49,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:49,237 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 867 treesize of output 857 [2022-10-16 11:00:49,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:49,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 953 treesize of output 895 [2022-10-16 11:00:49,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:49,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 712 treesize of output 622 [2022-10-16 11:00:49,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:49,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 176 [2022-10-16 11:00:56,905 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 664 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-16 11:00:56,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:56,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 782 treesize of output 2369