/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/s32iff.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:50:54,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:50:54,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:50:54,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:50:54,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:50:54,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:50:54,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:50:54,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:50:54,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:50:54,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:50:54,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:50:54,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:50:54,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:50:54,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:50:54,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:50:54,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:50:54,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:50:54,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:50:54,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:50:54,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:50:54,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:50:54,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:50:54,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:50:54,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:50:54,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:50:54,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:50:54,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:50:54,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:50:54,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:50:54,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:50:54,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:50:54,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:50:54,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:50:54,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:50:54,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:50:54,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:50:54,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:50:54,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:50:54,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:50:54,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:50:54,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:50:54,481 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:50:54,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:50:54,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:50:54,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:50:54,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:50:54,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:50:54,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:50:54,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:50:54,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:50:54,547 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:50:54,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:50:54,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:50:54,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:50:54,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:50:54,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:50:54,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:50:54,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:50:54,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:50:54,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:50:54,551 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:50:54,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:50:54,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:50:54,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:50:54,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:50:54,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:50:54,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:50:54,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:50:54,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:50:54,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:50:54,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:50:54,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:50:54,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:50:54,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:50:54,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:50:54,555 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:50:54,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:50:54,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:50:54,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:50:54,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:50:54,992 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:50:54,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s32iff.c [2022-10-16 10:50:55,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0cc47ae/910650525bbe4349bea05bf15c33fc31/FLAGe5dd305dd [2022-10-16 10:50:55,784 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:50:55,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s32iff.c [2022-10-16 10:50:55,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0cc47ae/910650525bbe4349bea05bf15c33fc31/FLAGe5dd305dd [2022-10-16 10:50:56,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0cc47ae/910650525bbe4349bea05bf15c33fc31 [2022-10-16 10:50:56,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:50:56,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:50:56,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:50:56,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:50:56,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:50:56,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6189dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56, skipping insertion in model container [2022-10-16 10:50:56,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:50:56,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:50:56,370 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/s32iff.c[589,602] [2022-10-16 10:50:56,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:50:56,437 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:50:56,456 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/s32iff.c[589,602] [2022-10-16 10:50:56,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:50:56,516 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:50:56,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56 WrapperNode [2022-10-16 10:50:56,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:50:56,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:50:56,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:50:56,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:50:56,529 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:50:56" (1/1) ... [2022-10-16 10:50:56,555 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:50:56" (1/1) ... [2022-10-16 10:50:56,603 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-10-16 10:50:56,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:50:56,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:50:56,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:50:56,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:50:56,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:50:56,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:50:56,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:50:56,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:50:56,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (1/1) ... [2022-10-16 10:50:56,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:50:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:56,723 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:50:56,735 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:50:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:50:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:50:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:50:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:50:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:50:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:50:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:50:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:50:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:50:56,895 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:50:56,898 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:50:57,237 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:50:57,246 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:50:57,246 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 10:50:57,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:50:57 BoogieIcfgContainer [2022-10-16 10:50:57,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:50:57,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:50:57,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:50:57,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:50:57,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:50:56" (1/3) ... [2022-10-16 10:50:57,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a21bc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:50:57, skipping insertion in model container [2022-10-16 10:50:57,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:56" (2/3) ... [2022-10-16 10:50:57,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a21bc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:50:57, skipping insertion in model container [2022-10-16 10:50:57,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:50:57" (3/3) ... [2022-10-16 10:50:57,262 INFO L112 eAbstractionObserver]: Analyzing ICFG s32iff.c [2022-10-16 10:50:57,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:50:57,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:50:57,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:50:57,447 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;@45d67433, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:50:57,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:50:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 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:50:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:50:57,463 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:57,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:57,466 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:50:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:50:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:57,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221657719] [2022-10-16 10:50:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:57,722 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:50:57,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:57,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221657719] [2022-10-16 10:50:57,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221657719] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:57,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:57,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:50:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526036575] [2022-10-16 10:50:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:50:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:57,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:50:57,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:50:57,772 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 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:50:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:57,797 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2022-10-16 10:50:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:50:57,800 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:50:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:57,810 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:50:57,811 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 10:50:57,815 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:50:57,820 INFO L413 NwaCegarLoop]: 59 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, 59 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:50:57,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:50:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 10:50:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 10:50:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 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:50:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-16 10:50:57,868 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2022-10-16 10:50:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:57,869 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-16 10:50:57,869 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:50:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-16 10:50:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:50:57,870 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:57,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:57,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:50:57,871 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:50:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:50:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301716215] [2022-10-16 10:50:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:58,157 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:50:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:58,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301716215] [2022-10-16 10:50:58,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301716215] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:58,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:58,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:50:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560320608] [2022-10-16 10:50:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:58,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:58,164 INFO L87 Difference]: Start difference. First operand 48 states and 52 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:50:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:58,308 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-10-16 10:50:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:58,308 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:50:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:58,310 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:50:58,313 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 10:50:58,314 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:50:58,320 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:58,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 97 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:50:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 10:50:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-10-16 10:50:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 51 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:50:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-16 10:50:58,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 8 [2022-10-16 10:50:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:58,341 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-16 10:50:58,341 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:50:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-16 10:50:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:50:58,342 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:58,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:58,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:50:58,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:50:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 678258903, now seen corresponding path program 1 times [2022-10-16 10:50:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:58,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989452623] [2022-10-16 10:50:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:58,438 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:50:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989452623] [2022-10-16 10:50:58,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989452623] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:58,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:58,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:50:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091852048] [2022-10-16 10:50:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:58,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:58,442 INFO L87 Difference]: Start difference. First operand 52 states and 57 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:50:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:58,524 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-10-16 10:50:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:58,524 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:50:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:58,526 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:50:58,526 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:50:58,527 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:50:58,529 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 81 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:58,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:50:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:50:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2022-10-16 10:50:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 51 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:50:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-10-16 10:50:58,541 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2022-10-16 10:50:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:58,541 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-10-16 10:50:58,542 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:50:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-10-16 10:50:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:50:58,543 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:58,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:58,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:50:58,544 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:50:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:50:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:58,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510724721] [2022-10-16 10:50:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:58,741 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:50:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:58,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510724721] [2022-10-16 10:50:58,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510724721] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185475136] [2022-10-16 10:50:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:58,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:58,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:58,759 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:50:58,787 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:50:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:58,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:58,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:58,967 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:50:58,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:59,020 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:50:59,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185475136] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:59,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:59,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:50:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819039218] [2022-10-16 10:50:59,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:59,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:50:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:50:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:50:59,025 INFO L87 Difference]: Start difference. First operand 52 states and 56 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:50:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:59,209 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-10-16 10:50:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:50:59,210 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:50:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:59,213 INFO L225 Difference]: With dead ends: 99 [2022-10-16 10:50:59,214 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 10:50:59,215 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:50:59,217 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:59,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 157 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:50:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 10:50:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2022-10-16 10:50:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5) internal successors, (72), 62 states have internal predecessors, (72), 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:50:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-10-16 10:50:59,229 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 12 [2022-10-16 10:50:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:59,230 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-10-16 10:50:59,230 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:50:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-10-16 10:50:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:50:59,231 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:59,231 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:59,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 10:50:59,445 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:50:59,446 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:50:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:50:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:59,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798522851] [2022-10-16 10:50:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:59,598 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:50:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:59,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798522851] [2022-10-16 10:50:59,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798522851] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:59,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958056723] [2022-10-16 10:50:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:59,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:59,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:59,601 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:50:59,625 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:50:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:59,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:59,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:59,708 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:50:59,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:50:59,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958056723] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:59,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:50:59,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:50:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276007011] [2022-10-16 10:50:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:59,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:50:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:50:59,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:50:59,712 INFO L87 Difference]: Start difference. First operand 63 states and 72 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:50:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:59,801 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-10-16 10:50:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:50:59,801 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:50:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:59,803 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:50:59,803 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 10:50:59,803 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:50:59,805 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:59,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:50:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 10:50:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2022-10-16 10:50:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.4375) internal successors, (69), 61 states have internal predecessors, (69), 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:50:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-16 10:50:59,814 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 13 [2022-10-16 10:50:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:59,815 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-16 10:50:59,815 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:50:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-16 10:50:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:50:59,816 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:59,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:59,859 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:51:00,029 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:51:00,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash -825622317, now seen corresponding path program 1 times [2022-10-16 10:51:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925710663] [2022-10-16 10:51:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:00,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925710663] [2022-10-16 10:51:00,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925710663] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:00,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567584485] [2022-10-16 10:51:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:00,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:00,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:00,480 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:51:00,490 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:51:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:00,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 10:51:00,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:00,594 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 18 treesize of output 14 [2022-10-16 10:51:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:00,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:00,697 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 14 treesize of output 12 [2022-10-16 10:51:00,702 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:51:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:00,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567584485] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:00,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:00,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-10-16 10:51:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888900570] [2022-10-16 10:51:00,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:00,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 10:51:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 10:51:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 10:51:00,717 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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:51:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:00,831 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2022-10-16 10:51:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 10:51:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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:51:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:00,833 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:51:00,833 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 10:51:00,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:51:00,835 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:00,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 10:51:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2022-10-16 10:51:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 62 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:51:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-10-16 10:51:00,844 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2022-10-16 10:51:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:00,844 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-10-16 10:51:00,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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:51:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-10-16 10:51:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:51:00,846 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:00,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:00,885 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:51:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:01,060 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:51:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -825622509, now seen corresponding path program 1 times [2022-10-16 10:51:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:01,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570456842] [2022-10-16 10:51:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:01,134 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:51:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570456842] [2022-10-16 10:51:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570456842] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:01,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:51:01,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:51:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702836109] [2022-10-16 10:51:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:51:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:51:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:51:01,138 INFO L87 Difference]: Start difference. First operand 63 states and 70 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:51:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:01,180 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-10-16 10:51:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:51:01,181 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:51:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:01,182 INFO L225 Difference]: With dead ends: 63 [2022-10-16 10:51:01,182 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 10:51:01,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:51:01,183 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:01,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:51:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 10:51:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 10:51:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 60 states have internal predecessors, (68), 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:51:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-10-16 10:51:01,192 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-10-16 10:51:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:01,193 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-10-16 10:51:01,193 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:51:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-10-16 10:51:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 10:51:01,194 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:01,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:01,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 10:51:01,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1157615292, now seen corresponding path program 1 times [2022-10-16 10:51:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:01,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713737221] [2022-10-16 10:51:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:01,257 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:51:01,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:01,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713737221] [2022-10-16 10:51:01,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713737221] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:01,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:51:01,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:51:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398731331] [2022-10-16 10:51:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:01,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:51:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:01,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:51:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:51:01,261 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:01,321 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-10-16 10:51:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:51:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 10:51:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:01,323 INFO L225 Difference]: With dead ends: 82 [2022-10-16 10:51:01,323 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:51:01,323 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:51:01,324 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:01,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:51:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:51:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-10-16 10:51:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 65 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:51:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-16 10:51:01,333 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2022-10-16 10:51:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:01,334 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-16 10:51:01,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-16 10:51:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 10:51:01,335 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:01,335 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] [2022-10-16 10:51:01,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:51:01,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash 250320491, now seen corresponding path program 1 times [2022-10-16 10:51:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:01,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828351043] [2022-10-16 10:51:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828351043] [2022-10-16 10:51:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828351043] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:01,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173589813] [2022-10-16 10:51:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:01,482 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:51:01,497 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:51:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:01,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:51:01,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:01,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:01,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173589813] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:01,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:01,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:51:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894206028] [2022-10-16 10:51:01,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:01,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:51:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:51:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:51:01,728 INFO L87 Difference]: Start difference. First operand 66 states and 73 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:51:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:01,973 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-10-16 10:51:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:51:01,973 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 21 [2022-10-16 10:51:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:01,974 INFO L225 Difference]: With dead ends: 155 [2022-10-16 10:51:01,975 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:51:01,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:51:01,976 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:01,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 307 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:51:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2022-10-16 10:51:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 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:51:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-16 10:51:01,986 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2022-10-16 10:51:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:01,986 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-16 10:51:01,987 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:51:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-16 10:51:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:51:01,988 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:01,988 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] [2022-10-16 10:51:02,035 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:51:02,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:02,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash 38416049, now seen corresponding path program 1 times [2022-10-16 10:51:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:02,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757973818] [2022-10-16 10:51:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:02,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:02,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039186636] [2022-10-16 10:51:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:02,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:02,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:02,223 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:51:02,241 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:51:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:02,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:51:02,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-10-16 10:51:02,421 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 15 treesize of output 7 [2022-10-16 10:51:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:51:02,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:02,532 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 37 treesize of output 31 [2022-10-16 10:51:02,538 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:51:02,538 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 38 treesize of output 24 [2022-10-16 10:51:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:51:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:02,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757973818] [2022-10-16 10:51:02,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:02,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039186636] [2022-10-16 10:51:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039186636] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:02,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:02,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-10-16 10:51:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556378943] [2022-10-16 10:51:02,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:02,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:51:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:51:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:51:02,556 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:51:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:02,847 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2022-10-16 10:51:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:51:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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 23 [2022-10-16 10:51:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:02,849 INFO L225 Difference]: With dead ends: 153 [2022-10-16 10:51:02,849 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:51:02,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:51:02,850 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:02,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 319 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:51:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2022-10-16 10:51:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 96 states have internal predecessors, (115), 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:51:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-10-16 10:51:02,860 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 23 [2022-10-16 10:51:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:02,860 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-10-16 10:51:02,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:51:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-10-16 10:51:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:51:02,862 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:02,862 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] [2022-10-16 10:51:02,906 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:51:03,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 10:51:03,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 38415857, now seen corresponding path program 1 times [2022-10-16 10:51:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:03,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528973764] [2022-10-16 10:51:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:03,354 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:51:03,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:03,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528973764] [2022-10-16 10:51:03,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528973764] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:03,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:51:03,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:51:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829181424] [2022-10-16 10:51:03,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:03,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:51:03,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:03,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:51:03,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:51:03,357 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:51:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:03,438 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-10-16 10:51:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:51:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:51:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:03,440 INFO L225 Difference]: With dead ends: 108 [2022-10-16 10:51:03,440 INFO L226 Difference]: Without dead ends: 106 [2022-10-16 10:51:03,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 10:51:03,441 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:03,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-16 10:51:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-10-16 10:51:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 101 states have internal predecessors, (121), 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:51:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-10-16 10:51:03,451 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 23 [2022-10-16 10:51:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:03,452 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-10-16 10:51:03,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:51:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-10-16 10:51:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:51:03,453 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:03,453 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:03,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 10:51:03,455 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:51:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:51:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:03,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893025306] [2022-10-16 10:51:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:03,619 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:51:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:03,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893025306] [2022-10-16 10:51:03,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893025306] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:03,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741151675] [2022-10-16 10:51:03,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:03,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:03,622 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:51:03,644 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:51:03,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:51:03,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:03,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:51:03,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:03,748 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:51:03,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:03,873 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:51:03,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741151675] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:03,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:03,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:51:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70763374] [2022-10-16 10:51:03,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:03,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:51:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:51:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:51:03,877 INFO L87 Difference]: Start difference. First operand 102 states and 121 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:51:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:04,164 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-10-16 10:51:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:51:04,164 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:51:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:04,166 INFO L225 Difference]: With dead ends: 124 [2022-10-16 10:51:04,166 INFO L226 Difference]: Without dead ends: 123 [2022-10-16 10:51:04,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:51:04,167 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:04,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 170 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-16 10:51:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2022-10-16 10:51:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 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:51:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-10-16 10:51:04,187 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 24 [2022-10-16 10:51:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:04,187 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-10-16 10:51:04,187 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:51:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-10-16 10:51:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:51:04,191 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:04,191 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] [2022-10-16 10:51:04,231 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:51:04,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:04,405 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:51:04,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1920559343, now seen corresponding path program 2 times [2022-10-16 10:51:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:04,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505694509] [2022-10-16 10:51:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505694509] [2022-10-16 10:51:04,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505694509] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815530617] [2022-10-16 10:51:04,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:04,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:04,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:04,757 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:51:04,764 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:51:04,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:04,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:04,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 10:51:04,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:04,872 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 15 treesize of output 11 [2022-10-16 10:51:04,968 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:04,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:05,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:05,088 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 16 treesize of output 14 [2022-10-16 10:51:05,102 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 20 treesize of output 16 [2022-10-16 10:51:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:05,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815530617] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:05,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:05,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-10-16 10:51:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365758731] [2022-10-16 10:51:05,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:51:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:51:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:51:05,124 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:51:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:05,427 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-10-16 10:51:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:51:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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 25 [2022-10-16 10:51:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:05,429 INFO L225 Difference]: With dead ends: 156 [2022-10-16 10:51:05,429 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:51:05,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:51:05,430 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:05,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 317 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:51:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-10-16 10:51:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 92 states have internal predecessors, (111), 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:51:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-10-16 10:51:05,440 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 25 [2022-10-16 10:51:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:05,440 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-10-16 10:51:05,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:51:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-10-16 10:51:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:51:05,442 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:05,442 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] [2022-10-16 10:51:05,478 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:51:05,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:05,656 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1985602653, now seen corresponding path program 1 times [2022-10-16 10:51:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:05,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503014823] [2022-10-16 10:51:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,713 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:51:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:05,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503014823] [2022-10-16 10:51:05,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503014823] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:05,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:51:05,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:51:05,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741698023] [2022-10-16 10:51:05,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:05,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:51:05,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:05,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:51:05,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:51:05,716 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:05,772 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2022-10-16 10:51:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:51:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 10:51:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:05,773 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:51:05,774 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:51:05,774 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:51:05,775 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:05,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 99 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:51:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:51:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-10-16 10:51:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 100 states have internal predecessors, (121), 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:51:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-10-16 10:51:05,784 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 26 [2022-10-16 10:51:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:05,784 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-10-16 10:51:05,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-10-16 10:51:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:51:05,786 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:05,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:05,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:51:05,786 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2118394144, now seen corresponding path program 1 times [2022-10-16 10:51:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:05,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831082755] [2022-10-16 10:51:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:51:05,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:05,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831082755] [2022-10-16 10:51:05,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831082755] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:05,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484844476] [2022-10-16 10:51:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:05,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:05,866 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:51:05,888 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:51:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:51:05,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:51:05,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:51:06,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484844476] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:06,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:06,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:51:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837433362] [2022-10-16 10:51:06,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:06,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:51:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:51:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:51:06,012 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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:51:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:06,176 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2022-10-16 10:51:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:51:06,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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:51:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:06,178 INFO L225 Difference]: With dead ends: 148 [2022-10-16 10:51:06,178 INFO L226 Difference]: Without dead ends: 147 [2022-10-16 10:51:06,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 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:51:06,179 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 68 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:06,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 152 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-16 10:51:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-10-16 10:51:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 131 states have internal predecessors, (165), 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:51:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-10-16 10:51:06,190 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 28 [2022-10-16 10:51:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:06,191 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-10-16 10:51:06,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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:51:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-10-16 10:51:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:51:06,192 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:06,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:06,233 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:51:06,407 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,SelfDestructingSolverStorable14 [2022-10-16 10:51:06,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1245709113, now seen corresponding path program 1 times [2022-10-16 10:51:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:06,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761978571] [2022-10-16 10:51:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:51:06,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:06,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761978571] [2022-10-16 10:51:06,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761978571] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:06,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812599333] [2022-10-16 10:51:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:06,491 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:51:06,510 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:51:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:06,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:51:06,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:51:06,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:51:06,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812599333] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:06,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:51:06,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:51:06,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293345869] [2022-10-16 10:51:06,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:06,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:51:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:51:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:51:06,590 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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:51:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:06,673 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-10-16 10:51:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:51:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 29 [2022-10-16 10:51:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:06,674 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:51:06,675 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:51:06,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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:51:06,676 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:06,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:51:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-10-16 10:51:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.322314049586777) internal successors, (160), 130 states have internal predecessors, (160), 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:51:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-10-16 10:51:06,686 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 29 [2022-10-16 10:51:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:06,686 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-10-16 10:51:06,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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:51:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-10-16 10:51:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:51:06,687 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:06,688 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] [2022-10-16 10:51:06,728 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:51:06,903 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,SelfDestructingSolverStorable15 [2022-10-16 10:51:06,904 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 874414924, now seen corresponding path program 1 times [2022-10-16 10:51:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:06,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788022948] [2022-10-16 10:51:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:06,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:06,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857791253] [2022-10-16 10:51:06,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:06,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:06,933 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:51:06,940 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:51:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:07,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:51:07,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:07,102 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:51:07,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:07,178 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:51:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:07,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788022948] [2022-10-16 10:51:07,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:07,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857791253] [2022-10-16 10:51:07,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857791253] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:07,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:07,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:51:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912697655] [2022-10-16 10:51:07,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:51:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:51:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:51:07,181 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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:51:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:07,375 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2022-10-16 10:51:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:51:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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:51:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:07,377 INFO L225 Difference]: With dead ends: 143 [2022-10-16 10:51:07,377 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 10:51:07,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-10-16 10:51:07,379 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:07,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 239 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 10:51:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2022-10-16 10:51:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 104 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:51:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-10-16 10:51:07,388 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 30 [2022-10-16 10:51:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:07,388 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-10-16 10:51:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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:51:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-10-16 10:51:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 10:51:07,389 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:07,389 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:07,429 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:51:07,601 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,SelfDestructingSolverStorable16 [2022-10-16 10:51:07,602 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1892149553, now seen corresponding path program 3 times [2022-10-16 10:51:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:07,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69856770] [2022-10-16 10:51:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:07,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69856770] [2022-10-16 10:51:07,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69856770] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:07,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123705436] [2022-10-16 10:51:07,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:51:07,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:07,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:07,785 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:51:07,793 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:51:07,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:51:07,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:07,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:51:07,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:08,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:08,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123705436] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:08,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:08,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:51:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482417701] [2022-10-16 10:51:08,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:08,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:51:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:51:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:51:08,120 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 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:51:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:08,419 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2022-10-16 10:51:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:51:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 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 32 [2022-10-16 10:51:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:08,421 INFO L225 Difference]: With dead ends: 238 [2022-10-16 10:51:08,421 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:51:08,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:51:08,423 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 204 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:08,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 259 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:51:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-10-16 10:51:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.303030303030303) internal successors, (172), 141 states have internal predecessors, (172), 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:51:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-10-16 10:51:08,437 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 32 [2022-10-16 10:51:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:08,437 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-10-16 10:51:08,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 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:51:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-10-16 10:51:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:51:08,439 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:08,439 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, 1, 1, 1, 1, 1] [2022-10-16 10:51:08,478 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:51:08,654 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,SelfDestructingSolverStorable17 [2022-10-16 10:51:08,655 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1277475512, now seen corresponding path program 2 times [2022-10-16 10:51:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:08,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122713298] [2022-10-16 10:51:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:08,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:08,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683372477] [2022-10-16 10:51:08,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:08,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:08,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:08,678 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:51:08,696 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:51:08,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:08,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:08,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:51:08,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:08,851 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:51:08,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:08,911 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:51:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:08,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122713298] [2022-10-16 10:51:08,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:08,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683372477] [2022-10-16 10:51:08,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683372477] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:08,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:08,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:51:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963168254] [2022-10-16 10:51:08,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:51:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:51:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:51:08,914 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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:51:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:09,126 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-10-16 10:51:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:51:09,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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:51:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:09,128 INFO L225 Difference]: With dead ends: 187 [2022-10-16 10:51:09,128 INFO L226 Difference]: Without dead ends: 144 [2022-10-16 10:51:09,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:51:09,129 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:09,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 163 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-16 10:51:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-10-16 10:51:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 141 states have internal predecessors, (170), 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:51:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:51:09,140 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 34 [2022-10-16 10:51:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:09,140 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:51:09,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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:51:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:51:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:51:09,141 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:09,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:09,177 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:51:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:09,355 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:51:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash 315378123, now seen corresponding path program 4 times [2022-10-16 10:51:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:09,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414193037] [2022-10-16 10:51:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:10,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414193037] [2022-10-16 10:51:10,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414193037] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:10,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284618072] [2022-10-16 10:51:10,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:51:10,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:10,078 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:51:10,090 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:51:10,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:51:10,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:10,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:51:10,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:10,231 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 13 treesize of output 9 [2022-10-16 10:51:10,298 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:10,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:10,377 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:10,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:10,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:10,622 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 16 treesize of output 14 [2022-10-16 10:51:10,626 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 20 treesize of output 16 [2022-10-16 10:51:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:10,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284618072] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:10,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:10,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-10-16 10:51:10,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531270459] [2022-10-16 10:51:10,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:10,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:51:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:10,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:51:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:51:10,659 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 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:51:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:11,451 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-10-16 10:51:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:51:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 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:51:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:11,453 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:51:11,453 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 10:51:11,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:51:11,455 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:11,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 740 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:51:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 10:51:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-10-16 10:51:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 132 states have internal predecessors, (156), 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:51:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2022-10-16 10:51:11,479 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2022-10-16 10:51:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:11,480 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2022-10-16 10:51:11,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 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:51:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2022-10-16 10:51:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:51:11,480 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:11,482 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, 1, 1, 1, 1, 1] [2022-10-16 10:51:11,523 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:51:11,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-10-16 10:51:11,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1855075176, now seen corresponding path program 3 times [2022-10-16 10:51:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:11,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984574001] [2022-10-16 10:51:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:11,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:11,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710279407] [2022-10-16 10:51:11,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:51:11,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:11,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:11,717 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:51:11,738 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:51:11,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:51:11,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:11,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:51:11,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:11,817 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:51:11,924 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 37 treesize of output 17 [2022-10-16 10:51:12,157 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 18 treesize of output 20 [2022-10-16 10:51:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:51:12,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:12,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (< |v_ULTIMATE.start_main_~i~0#1_76| c_~N~0)))) is different from false [2022-10-16 10:51:12,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_76| 1)) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 10:51:12,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_76|))) is different from false [2022-10-16 10:51:12,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_76|) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 10:51:12,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:12,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-10-16 10:51:12,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:12,825 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 42 treesize of output 38 [2022-10-16 10:51:12,833 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 13 treesize of output 7 [2022-10-16 10:51:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-10-16 10:51:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984574001] [2022-10-16 10:51:12,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710279407] [2022-10-16 10:51:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710279407] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:12,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:12,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:51:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511105909] [2022-10-16 10:51:12,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:12,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:51:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:51:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=605, Unknown=10, NotChecked=212, Total=930 [2022-10-16 10:51:12,996 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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:51:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:13,773 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2022-10-16 10:51:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:51:13,774 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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) Word has length 41 [2022-10-16 10:51:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:13,775 INFO L225 Difference]: With dead ends: 188 [2022-10-16 10:51:13,775 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:51:13,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=1190, Unknown=25, NotChecked=300, Total=1722 [2022-10-16 10:51:13,777 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:13,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 347 Unchecked, 0.1s Time] [2022-10-16 10:51:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:51:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-10-16 10:51:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 158 states have internal predecessors, (192), 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:51:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2022-10-16 10:51:13,790 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 41 [2022-10-16 10:51:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:13,790 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2022-10-16 10:51:13,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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:51:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2022-10-16 10:51:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:51:13,791 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:13,792 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, 1, 1, 1, 1] [2022-10-16 10:51:13,837 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:51:14,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:14,006 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1855074984, now seen corresponding path program 1 times [2022-10-16 10:51:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:14,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14049288] [2022-10-16 10:51:14,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:51:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:14,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14049288] [2022-10-16 10:51:14,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14049288] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:14,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988177035] [2022-10-16 10:51:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:14,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:14,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:14,439 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:51:14,468 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:51:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:14,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-16 10:51:14,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:14,550 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:51:14,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:51:14,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:51:14,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:51:14,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:51:14,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:51:14,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:51:14,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:14,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2022-10-16 10:51:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:14,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:15,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_509 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_86| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_509))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_509 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (< 4 .cse0) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0) v_ArrVal_510) (< (+ v_ArrVal_510 .cse2) 9223372036854775808) (< 4 .cse2)))))) is different from false [2022-10-16 10:51:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2022-10-16 10:51:15,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988177035] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:15,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:15,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-10-16 10:51:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018797485] [2022-10-16 10:51:15,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:15,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:51:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:15,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:51:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=1, NotChecked=38, Total=462 [2022-10-16 10:51:15,967 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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:51:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:16,127 INFO L93 Difference]: Finished difference Result 185 states and 224 transitions. [2022-10-16 10:51:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:51:16,128 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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:51:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:16,129 INFO L225 Difference]: With dead ends: 185 [2022-10-16 10:51:16,130 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 10:51:16,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2022-10-16 10:51:16,131 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:16,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 222 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 89 Unchecked, 0.0s Time] [2022-10-16 10:51:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 10:51:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2022-10-16 10:51:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 165 states have (on average 1.290909090909091) internal successors, (213), 174 states have internal predecessors, (213), 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:51:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2022-10-16 10:51:16,165 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 41 [2022-10-16 10:51:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:16,165 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2022-10-16 10:51:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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:51:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2022-10-16 10:51:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:51:16,166 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:16,166 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, 1] [2022-10-16 10:51:16,206 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:51:16,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:16,379 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1672749764, now seen corresponding path program 1 times [2022-10-16 10:51:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:16,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138419506] [2022-10-16 10:51:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138419506] [2022-10-16 10:51:16,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138419506] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837359922] [2022-10-16 10:51:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:16,592 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:51:16,608 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:51:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:16,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 10:51:16,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:16,677 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:51:16,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:16,715 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 39 treesize of output 31 [2022-10-16 10:51:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:16,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:51:16,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837359922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:16,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:51:16,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-10-16 10:51:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739444582] [2022-10-16 10:51:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:16,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:51:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:51:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:51:16,737 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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:51:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:16,817 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2022-10-16 10:51:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:51:16,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 42 [2022-10-16 10:51:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:16,819 INFO L225 Difference]: With dead ends: 175 [2022-10-16 10:51:16,819 INFO L226 Difference]: Without dead ends: 174 [2022-10-16 10:51:16,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:51:16,820 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:16,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-10-16 10:51:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-10-16 10:51:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 173 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:51:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-10-16 10:51:16,835 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 42 [2022-10-16 10:51:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:16,836 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-10-16 10:51:16,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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:51:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-10-16 10:51:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:51:16,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:16,837 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:16,876 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:51:17,051 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,SelfDestructingSolverStorable22 [2022-10-16 10:51:17,052 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435661, now seen corresponding path program 5 times [2022-10-16 10:51:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:17,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665860470] [2022-10-16 10:51:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:17,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665860470] [2022-10-16 10:51:17,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665860470] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:17,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134647152] [2022-10-16 10:51:17,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:51:17,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:17,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:17,330 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:51:17,333 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:51:17,441 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:51:17,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:17,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:51:17,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:17,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:17,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134647152] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:17,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:17,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:51:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423912134] [2022-10-16 10:51:17,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:17,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:51:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:51:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:51:17,872 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 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:51:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:18,392 INFO L93 Difference]: Finished difference Result 330 states and 395 transitions. [2022-10-16 10:51:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:51:18,393 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 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) Word has length 43 [2022-10-16 10:51:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:18,395 INFO L225 Difference]: With dead ends: 330 [2022-10-16 10:51:18,395 INFO L226 Difference]: Without dead ends: 255 [2022-10-16 10:51:18,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:51:18,397 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 190 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:18,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 339 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:51:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-16 10:51:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 218. [2022-10-16 10:51:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 209 states have (on average 1.2344497607655502) internal successors, (258), 217 states have internal predecessors, (258), 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:51:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2022-10-16 10:51:18,416 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 43 [2022-10-16 10:51:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:18,416 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2022-10-16 10:51:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 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:51:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2022-10-16 10:51:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:51:18,417 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:18,417 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] [2022-10-16 10:51:18,454 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:51:18,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:18,630 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:18,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1194758214, now seen corresponding path program 1 times [2022-10-16 10:51:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:18,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057341711] [2022-10-16 10:51:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:18,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:18,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057341711] [2022-10-16 10:51:18,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057341711] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:18,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212492882] [2022-10-16 10:51:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:18,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:18,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:18,719 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:51:18,738 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:51:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:18,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:51:18,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:18,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:18,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212492882] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:18,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:18,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:51:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016491688] [2022-10-16 10:51:18,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:51:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:18,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:51:18,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:51:18,872 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 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:51:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:19,047 INFO L93 Difference]: Finished difference Result 292 states and 351 transitions. [2022-10-16 10:51:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:51:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 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 44 [2022-10-16 10:51:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:19,050 INFO L225 Difference]: With dead ends: 292 [2022-10-16 10:51:19,050 INFO L226 Difference]: Without dead ends: 291 [2022-10-16 10:51:19,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 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:51:19,051 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:19,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 188 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-10-16 10:51:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 266. [2022-10-16 10:51:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 257 states have (on average 1.2879377431906616) internal successors, (331), 265 states have internal predecessors, (331), 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:51:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2022-10-16 10:51:19,077 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 44 [2022-10-16 10:51:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:19,077 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2022-10-16 10:51:19,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 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:51:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2022-10-16 10:51:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:51:19,078 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:19,079 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-10-16 10:51:19,127 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:51:19,293 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:51:19,293 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1617200910, now seen corresponding path program 1 times [2022-10-16 10:51:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:19,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471596143] [2022-10-16 10:51:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471596143] [2022-10-16 10:51:19,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471596143] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256726531] [2022-10-16 10:51:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:19,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:19,423 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:51:19,443 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:51:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:19,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:51:19,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:19,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:51:19,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256726531] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:19,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:51:19,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:51:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493831909] [2022-10-16 10:51:19,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:19,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:51:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:51:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:51:19,535 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:19,623 INFO L93 Difference]: Finished difference Result 268 states and 331 transitions. [2022-10-16 10:51:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:51:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-10-16 10:51:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:19,625 INFO L225 Difference]: With dead ends: 268 [2022-10-16 10:51:19,626 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 10:51:19,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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:51:19,627 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:19,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 10:51:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-10-16 10:51:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 264 states have internal predecessors, (321), 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:51:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 321 transitions. [2022-10-16 10:51:19,649 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 321 transitions. Word has length 45 [2022-10-16 10:51:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:19,650 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 321 transitions. [2022-10-16 10:51:19,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 321 transitions. [2022-10-16 10:51:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:51:19,651 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:19,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:19,698 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:51:19,865 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:51:19,865 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:19,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 411246071, now seen corresponding path program 6 times [2022-10-16 10:51:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:19,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124244535] [2022-10-16 10:51:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124244535] [2022-10-16 10:51:20,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124244535] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723152814] [2022-10-16 10:51:20,829 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:51:20,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:20,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:20,830 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:51:20,835 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:51:20,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:51:20,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:20,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:51:20,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:21,038 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 13 treesize of output 9 [2022-10-16 10:51:21,109 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:21,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:21,192 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:21,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:21,281 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:21,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:21,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:21,635 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 16 treesize of output 14 [2022-10-16 10:51:21,638 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 20 treesize of output 16 [2022-10-16 10:51:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:21,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723152814] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:21,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:21,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2022-10-16 10:51:21,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690827894] [2022-10-16 10:51:21,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:21,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:51:21,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:51:21,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2022-10-16 10:51:21,676 INFO L87 Difference]: Start difference. First operand 265 states and 321 transitions. Second operand has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 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 10:51:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:22,825 INFO L93 Difference]: Finished difference Result 343 states and 418 transitions. [2022-10-16 10:51:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:51:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 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 10:51:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:22,833 INFO L225 Difference]: With dead ends: 343 [2022-10-16 10:51:22,833 INFO L226 Difference]: Without dead ends: 275 [2022-10-16 10:51:22,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2022-10-16 10:51:22,835 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:22,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 859 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:51:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-10-16 10:51:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-10-16 10:51:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 260 states have internal predecessors, (314), 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:51:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2022-10-16 10:51:22,856 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 47 [2022-10-16 10:51:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:22,857 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2022-10-16 10:51:22,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 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 10:51:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2022-10-16 10:51:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 10:51:22,858 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:22,858 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-10-16 10:51:22,898 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 10:51:23,072 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 10:51:23,073 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 377560238, now seen corresponding path program 1 times [2022-10-16 10:51:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:23,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779824340] [2022-10-16 10:51:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 10:51:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779824340] [2022-10-16 10:51:23,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779824340] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169856869] [2022-10-16 10:51:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:23,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:23,166 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 10:51:23,191 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 10:51:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:23,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 10:51:23,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:51:23,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:51:23,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169856869] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:23,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:23,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 24 [2022-10-16 10:51:23,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193867684] [2022-10-16 10:51:23,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:23,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:51:23,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:51:23,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:51:23,546 INFO L87 Difference]: Start difference. First operand 261 states and 314 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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:51:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:24,099 INFO L93 Difference]: Finished difference Result 571 states and 679 transitions. [2022-10-16 10:51:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:51:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-10-16 10:51:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:24,104 INFO L225 Difference]: With dead ends: 571 [2022-10-16 10:51:24,104 INFO L226 Difference]: Without dead ends: 564 [2022-10-16 10:51:24,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=508, Invalid=1748, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 10:51:24,107 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 531 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:24,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 314 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-10-16 10:51:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 339. [2022-10-16 10:51:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 338 states have internal predecessors, (409), 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:51:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 409 transitions. [2022-10-16 10:51:24,169 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 409 transitions. Word has length 49 [2022-10-16 10:51:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:24,170 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 409 transitions. [2022-10-16 10:51:24,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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:51:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 409 transitions. [2022-10-16 10:51:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:51:24,171 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:24,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:24,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:24,385 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 10:51:24,386 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash 522181700, now seen corresponding path program 4 times [2022-10-16 10:51:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:24,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263283657] [2022-10-16 10:51:24,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:24,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255578125] [2022-10-16 10:51:24,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:51:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:24,405 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 10:51:24,428 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 10:51:24,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:51:24,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:24,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-16 10:51:24,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:24,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:51:24,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:51:24,837 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 25 treesize of output 24 [2022-10-16 10:51:24,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:51:24,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:51:25,017 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 15 treesize of output 7 [2022-10-16 10:51:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:25,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:25,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:51:25,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:51:25,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:51:25,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))) is different from false [2022-10-16 10:51:25,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:51:27,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:51:27,326 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:51:27,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:51:27,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:27,334 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 38 treesize of output 34 [2022-10-16 10:51:27,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-16 10:51:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 24 not checked. [2022-10-16 10:51:27,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:27,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263283657] [2022-10-16 10:51:27,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:27,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255578125] [2022-10-16 10:51:27,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255578125] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:27,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:27,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:51:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128026590] [2022-10-16 10:51:27,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:27,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:51:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:51:27,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=510, Unknown=6, NotChecked=306, Total=930 [2022-10-16 10:51:27,464 INFO L87 Difference]: Start difference. First operand 339 states and 409 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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:51:28,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:51:30,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))))) is different from false [2022-10-16 10:51:31,036 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse1) 4) (forall ((v_ArrVal_800 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:51:33,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((v_ArrVal_800 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))))) is different from false [2022-10-16 10:51:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:33,408 INFO L93 Difference]: Finished difference Result 525 states and 651 transitions. [2022-10-16 10:51:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 10:51:33,409 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 52 [2022-10-16 10:51:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:33,411 INFO L225 Difference]: With dead ends: 525 [2022-10-16 10:51:33,412 INFO L226 Difference]: Without dead ends: 456 [2022-10-16 10:51:33,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=165, Invalid=795, Unknown=10, NotChecked=670, Total=1640 [2022-10-16 10:51:33,414 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 92 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:33,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 362 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 522 Invalid, 0 Unknown, 522 Unchecked, 0.3s Time] [2022-10-16 10:51:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-10-16 10:51:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 363. [2022-10-16 10:51:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 355 states have (on average 1.2253521126760563) internal successors, (435), 362 states have internal predecessors, (435), 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:51:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 435 transitions. [2022-10-16 10:51:33,449 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 435 transitions. Word has length 52 [2022-10-16 10:51:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:33,449 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 435 transitions. [2022-10-16 10:51:33,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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:51:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 435 transitions. [2022-10-16 10:51:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 10:51:33,451 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:33,451 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:33,489 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 10:51:33,665 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 10:51:33,666 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 10:51:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 819079367, now seen corresponding path program 7 times [2022-10-16 10:51:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:33,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905608456] [2022-10-16 10:51:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:34,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:34,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905608456] [2022-10-16 10:51:34,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905608456] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:34,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122888546] [2022-10-16 10:51:34,063 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:51:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:34,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:34,065 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 10:51:34,089 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 10:51:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:34,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:51:34,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:34,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:34,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122888546] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:34,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:34,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2022-10-16 10:51:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116857191] [2022-10-16 10:51:34,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:34,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:51:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:34,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:51:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:51:34,795 INFO L87 Difference]: Start difference. First operand 363 states and 435 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 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:51:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:35,813 INFO L93 Difference]: Finished difference Result 544 states and 648 transitions. [2022-10-16 10:51:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-16 10:51:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 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 54 [2022-10-16 10:51:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:35,817 INFO L225 Difference]: With dead ends: 544 [2022-10-16 10:51:35,818 INFO L226 Difference]: Without dead ends: 458 [2022-10-16 10:51:35,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=599, Invalid=3183, Unknown=0, NotChecked=0, Total=3782 [2022-10-16 10:51:35,821 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 285 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:35,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 423 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:51:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-10-16 10:51:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 386. [2022-10-16 10:51:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 378 states have (on average 1.216931216931217) internal successors, (460), 385 states have internal predecessors, (460), 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:51:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2022-10-16 10:51:35,870 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 54 [2022-10-16 10:51:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:35,870 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2022-10-16 10:51:35,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 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:51:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2022-10-16 10:51:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 10:51:35,872 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:35,872 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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:51:35,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-10-16 10:51:36,087 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 10:51:36,088 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -878456120, now seen corresponding path program 5 times [2022-10-16 10:51:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:36,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038501528] [2022-10-16 10:51:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:36,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:36,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300274092] [2022-10-16 10:51:36,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:51:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:36,124 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 10:51:36,150 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 10:51:36,271 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:51:36,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:36,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 10:51:36,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:51:36,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:51:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038501528] [2022-10-16 10:51:36,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300274092] [2022-10-16 10:51:36,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300274092] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:36,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:36,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-10-16 10:51:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275123603] [2022-10-16 10:51:36,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:36,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:51:36,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:36,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:51:36,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:51:36,696 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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:51:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:37,384 INFO L93 Difference]: Finished difference Result 482 states and 560 transitions. [2022-10-16 10:51:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:51:37,385 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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 55 [2022-10-16 10:51:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:37,386 INFO L225 Difference]: With dead ends: 482 [2022-10-16 10:51:37,387 INFO L226 Difference]: Without dead ends: 400 [2022-10-16 10:51:37,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=1699, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:51:37,388 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 243 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:37,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 275 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:51:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-10-16 10:51:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2022-10-16 10:51:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 388 states have (on average 1.208762886597938) internal successors, (469), 395 states have internal predecessors, (469), 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:51:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 469 transitions. [2022-10-16 10:51:37,429 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 469 transitions. Word has length 55 [2022-10-16 10:51:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:37,430 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 469 transitions. [2022-10-16 10:51:37,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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:51:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 469 transitions. [2022-10-16 10:51:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:51:37,431 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:37,431 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:37,473 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 10:51:37,644 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 10:51:37,644 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash -970475837, now seen corresponding path program 8 times [2022-10-16 10:51:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:37,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468403376] [2022-10-16 10:51:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468403376] [2022-10-16 10:51:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468403376] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255151543] [2022-10-16 10:51:38,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:38,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:38,741 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 10:51:38,743 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 10:51:38,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:38,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:38,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:51:38,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:38,890 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 15 treesize of output 11 [2022-10-16 10:51:38,940 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:38,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:38,997 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:38,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:39,086 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:39,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:39,187 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:39,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:39,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:39,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-16 10:51:39,439 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 20 treesize of output 16 [2022-10-16 10:51:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:39,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255151543] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:39,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:39,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 32 [2022-10-16 10:51:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796128585] [2022-10-16 10:51:39,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:39,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:51:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:39,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:51:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:51:39,511 INFO L87 Difference]: Start difference. First operand 396 states and 469 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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:51:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:40,805 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2022-10-16 10:51:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:51:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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 58 [2022-10-16 10:51:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:40,813 INFO L225 Difference]: With dead ends: 541 [2022-10-16 10:51:40,813 INFO L226 Difference]: Without dead ends: 423 [2022-10-16 10:51:40,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:51:40,817 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 116 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:40,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 849 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 10:51:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-16 10:51:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 398. [2022-10-16 10:51:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.2076923076923076) internal successors, (471), 397 states have internal predecessors, (471), 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:51:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 471 transitions. [2022-10-16 10:51:40,865 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 471 transitions. Word has length 58 [2022-10-16 10:51:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:40,866 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 471 transitions. [2022-10-16 10:51:40,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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:51:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 471 transitions. [2022-10-16 10:51:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:51:40,867 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:40,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:40,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-10-16 10:51:41,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-10-16 10:51:41,074 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1085736359, now seen corresponding path program 6 times [2022-10-16 10:51:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:41,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872577602] [2022-10-16 10:51:41,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:41,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:41,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673440349] [2022-10-16 10:51:41,097 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:51:41,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:41,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:41,098 INFO L229 MonitoredProcess]: Starting monitored process 27 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:51:41,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-10-16 10:51:41,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-10-16 10:51:41,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:41,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-16 10:51:41,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:41,246 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:51:41,492 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 37 treesize of output 17 [2022-10-16 10:51:41,772 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 18 treesize of output 20 [2022-10-16 10:51:41,977 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 18 treesize of output 20 [2022-10-16 10:51:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:51:42,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:42,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_165| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_165| 2) (not (< |v_ULTIMATE.start_main_~i~0#1_165| c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_165| 4))) 4))) is different from false [2022-10-16 10:51:43,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:43,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-10-16 10:51:43,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:43,247 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 42 treesize of output 38 [2022-10-16 10:51:43,259 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 13 treesize of output 7 [2022-10-16 10:51:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:51:43,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:43,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872577602] [2022-10-16 10:51:43,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:43,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673440349] [2022-10-16 10:51:43,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673440349] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:43,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:43,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-10-16 10:51:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076726284] [2022-10-16 10:51:43,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:43,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:51:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:43,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:51:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1587, Unknown=4, NotChecked=82, Total=1892 [2022-10-16 10:51:43,826 INFO L87 Difference]: Start difference. First operand 398 states and 471 transitions. Second operand has 44 states, 44 states have (on average 2.25) internal successors, (99), 44 states have internal predecessors, (99), 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:51:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:44,968 INFO L93 Difference]: Finished difference Result 402 states and 471 transitions. [2022-10-16 10:51:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-16 10:51:44,968 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.25) internal successors, (99), 44 states have internal predecessors, (99), 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 59 [2022-10-16 10:51:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:44,971 INFO L225 Difference]: With dead ends: 402 [2022-10-16 10:51:44,971 INFO L226 Difference]: Without dead ends: 358 [2022-10-16 10:51:44,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=514, Invalid=3026, Unknown=4, NotChecked=116, Total=3660 [2022-10-16 10:51:44,974 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 83 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:44,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 432 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 268 Invalid, 0 Unknown, 455 Unchecked, 0.2s Time] [2022-10-16 10:51:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-10-16 10:51:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2022-10-16 10:51:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 348 states have (on average 1.2270114942528736) internal successors, (427), 355 states have internal predecessors, (427), 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:51:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 427 transitions. [2022-10-16 10:51:45,007 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 427 transitions. Word has length 59 [2022-10-16 10:51:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:45,008 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 427 transitions. [2022-10-16 10:51:45,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.25) internal successors, (99), 44 states have internal predecessors, (99), 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:51:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 427 transitions. [2022-10-16 10:51:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:51:45,009 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:45,009 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:45,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:45,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-16 10:51:45,222 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2026433844, now seen corresponding path program 2 times [2022-10-16 10:51:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:45,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882283147] [2022-10-16 10:51:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:51:45,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:45,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882283147] [2022-10-16 10:51:45,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882283147] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:45,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849811757] [2022-10-16 10:51:45,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:45,416 INFO L229 MonitoredProcess]: Starting monitored process 28 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:51:45,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-10-16 10:51:45,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:51:45,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:45,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:51:45,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:51:45,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:51:45,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849811757] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:45,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:45,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:51:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049156026] [2022-10-16 10:51:45,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:51:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:51:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:51:45,671 INFO L87 Difference]: Start difference. First operand 356 states and 427 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 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:51:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:45,983 INFO L93 Difference]: Finished difference Result 374 states and 447 transitions. [2022-10-16 10:51:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:51:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 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 61 [2022-10-16 10:51:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:45,985 INFO L225 Difference]: With dead ends: 374 [2022-10-16 10:51:45,986 INFO L226 Difference]: Without dead ends: 373 [2022-10-16 10:51:45,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:51:45,987 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 102 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:45,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 148 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-10-16 10:51:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2022-10-16 10:51:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 348 states have (on average 1.2155172413793103) internal successors, (423), 354 states have internal predecessors, (423), 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:51:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 423 transitions. [2022-10-16 10:51:46,026 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 423 transitions. Word has length 61 [2022-10-16 10:51:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 423 transitions. [2022-10-16 10:51:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 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:51:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 423 transitions. [2022-10-16 10:51:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:51:46,028 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:46,028 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:46,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:46,243 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1574972464, now seen corresponding path program 7 times [2022-10-16 10:51:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596533815] [2022-10-16 10:51:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:46,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:46,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082791153] [2022-10-16 10:51:46,264 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:51:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:46,265 INFO L229 MonitoredProcess]: Starting monitored process 29 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:51:46,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-10-16 10:51:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:46,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 10:51:46,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:51:46,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:51:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:46,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596533815] [2022-10-16 10:51:46,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:46,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082791153] [2022-10-16 10:51:46,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082791153] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:46,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:46,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-10-16 10:51:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504768667] [2022-10-16 10:51:46,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:46,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:51:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:51:46,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-10-16 10:51:46,756 INFO L87 Difference]: Start difference. First operand 355 states and 423 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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:51:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:47,316 INFO L93 Difference]: Finished difference Result 446 states and 534 transitions. [2022-10-16 10:51:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:51:47,317 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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 63 [2022-10-16 10:51:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:47,319 INFO L225 Difference]: With dead ends: 446 [2022-10-16 10:51:47,319 INFO L226 Difference]: Without dead ends: 323 [2022-10-16 10:51:47,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:51:47,321 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 185 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:47,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 270 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:51:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-10-16 10:51:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2022-10-16 10:51:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 314 states have (on average 1.21656050955414) internal successors, (382), 320 states have internal predecessors, (382), 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:51:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 382 transitions. [2022-10-16 10:51:47,351 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 382 transitions. Word has length 63 [2022-10-16 10:51:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:47,352 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 382 transitions. [2022-10-16 10:51:47,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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:51:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 382 transitions. [2022-10-16 10:51:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 10:51:47,353 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:47,353 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:47,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:47,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:47,568 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash 482497147, now seen corresponding path program 9 times [2022-10-16 10:51:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:47,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442861042] [2022-10-16 10:51:47,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 51 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:48,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442861042] [2022-10-16 10:51:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442861042] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521347058] [2022-10-16 10:51:48,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:51:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:48,136 INFO L229 MonitoredProcess]: Starting monitored process 30 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:51:48,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-10-16 10:51:48,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:51:48,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:48,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:51:48,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:48,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:49,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521347058] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:49,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:49,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2022-10-16 10:51:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620391450] [2022-10-16 10:51:49,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:51:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:51:49,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:51:49,336 INFO L87 Difference]: Start difference. First operand 321 states and 382 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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:51:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:50,406 INFO L93 Difference]: Finished difference Result 508 states and 604 transitions. [2022-10-16 10:51:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 10:51:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 65 [2022-10-16 10:51:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:50,410 INFO L225 Difference]: With dead ends: 508 [2022-10-16 10:51:50,410 INFO L226 Difference]: Without dead ends: 423 [2022-10-16 10:51:50,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 94 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=702, Invalid=3854, Unknown=0, NotChecked=0, Total=4556 [2022-10-16 10:51:50,413 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 368 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:50,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 360 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:51:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-16 10:51:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 358. [2022-10-16 10:51:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 351 states have (on average 1.1965811965811965) internal successors, (420), 357 states have internal predecessors, (420), 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:51:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 420 transitions. [2022-10-16 10:51:50,444 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 420 transitions. Word has length 65 [2022-10-16 10:51:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:50,444 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 420 transitions. [2022-10-16 10:51:50,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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:51:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 420 transitions. [2022-10-16 10:51:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 10:51:50,445 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:50,445 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:50,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:50,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:50,646 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1153339649, now seen corresponding path program 10 times [2022-10-16 10:51:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378610747] [2022-10-16 10:51:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:52,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378610747] [2022-10-16 10:51:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378610747] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:52,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086033356] [2022-10-16 10:51:52,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:51:52,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:52,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:52,177 INFO L229 MonitoredProcess]: Starting monitored process 31 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:51:52,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-10-16 10:51:52,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:51:52,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:52,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 10:51:52,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:52,382 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 15 treesize of output 11 [2022-10-16 10:51:52,447 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:52,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:52,528 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:52,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:52,638 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:52,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:52,759 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:52,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:52,881 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:53,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:53,204 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 16 treesize of output 14 [2022-10-16 10:51:53,206 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 20 treesize of output 16 [2022-10-16 10:51:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:53,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086033356] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:53,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:53,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 38 [2022-10-16 10:51:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926069470] [2022-10-16 10:51:53,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:53,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:51:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:51:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:51:53,288 INFO L87 Difference]: Start difference. First operand 358 states and 420 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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:51:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:55,085 INFO L93 Difference]: Finished difference Result 516 states and 624 transitions. [2022-10-16 10:51:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:51:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 69 [2022-10-16 10:51:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:55,088 INFO L225 Difference]: With dead ends: 516 [2022-10-16 10:51:55,089 INFO L226 Difference]: Without dead ends: 399 [2022-10-16 10:51:55,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2022-10-16 10:51:55,091 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 119 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:55,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 995 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-10-16 10:51:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-10-16 10:51:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 372. [2022-10-16 10:51:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 365 states have (on average 1.1945205479452055) internal successors, (436), 371 states have internal predecessors, (436), 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:51:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 436 transitions. [2022-10-16 10:51:55,128 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 436 transitions. Word has length 69 [2022-10-16 10:51:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:55,128 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 436 transitions. [2022-10-16 10:51:55,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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:51:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 436 transitions. [2022-10-16 10:51:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:51:55,129 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:55,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:55,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:55,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 10:51:55,343 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1198011565, now seen corresponding path program 8 times [2022-10-16 10:51:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238284590] [2022-10-16 10:51:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:55,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:55,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150317971] [2022-10-16 10:51:55,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:55,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:55,366 INFO L229 MonitoredProcess]: Starting monitored process 32 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:51:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-10-16 10:51:55,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:55,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:55,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-16 10:51:55,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:55,503 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:51:55,648 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 37 treesize of output 17 [2022-10-16 10:51:55,762 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:55,762 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 25 treesize of output 24 [2022-10-16 10:51:55,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:51:55,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:51:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:51:56,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:56,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:51:56,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:51:56,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:51:56,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:51:56,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:51:56,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) is different from false [2022-10-16 10:51:56,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:51:58,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:51:58,376 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:51:58,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:51:58,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:58,387 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 38 treesize of output 34 [2022-10-16 10:51:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:51:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:58,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238284590] [2022-10-16 10:51:58,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:58,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150317971] [2022-10-16 10:51:58,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150317971] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:58,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:58,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2022-10-16 10:51:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016443883] [2022-10-16 10:51:58,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:58,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:51:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:51:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=571, Unknown=8, NotChecked=440, Total=1122 [2022-10-16 10:51:58,472 INFO L87 Difference]: Start difference. First operand 372 states and 436 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 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:51:59,334 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2022-10-16 10:52:01,338 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:52:02,063 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse2) 4) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))) is different from false [2022-10-16 10:52:02,672 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) is different from false [2022-10-16 10:52:04,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) is different from false [2022-10-16 10:52:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:05,221 INFO L93 Difference]: Finished difference Result 532 states and 636 transitions. [2022-10-16 10:52:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:52:05,221 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 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 70 [2022-10-16 10:52:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:05,223 INFO L225 Difference]: With dead ends: 532 [2022-10-16 10:52:05,224 INFO L226 Difference]: Without dead ends: 481 [2022-10-16 10:52:05,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=170, Invalid=991, Unknown=13, NotChecked=988, Total=2162 [2022-10-16 10:52:05,228 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 101 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 635 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:05,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 550 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 791 Invalid, 0 Unknown, 635 Unchecked, 0.5s Time] [2022-10-16 10:52:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-10-16 10:52:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 406. [2022-10-16 10:52:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 399 states have (on average 1.1854636591478698) internal successors, (473), 405 states have internal predecessors, (473), 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:52:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 473 transitions. [2022-10-16 10:52:05,267 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 473 transitions. Word has length 70 [2022-10-16 10:52:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:05,267 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 473 transitions. [2022-10-16 10:52:05,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 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:52:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 473 transitions. [2022-10-16 10:52:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 10:52:05,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:05,269 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:05,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-10-16 10:52:05,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-16 10:52:05,483 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1968023236, now seen corresponding path program 9 times [2022-10-16 10:52:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621603789] [2022-10-16 10:52:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:05,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:52:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126337518] [2022-10-16 10:52:05,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:52:05,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:05,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:05,520 INFO L229 MonitoredProcess]: Starting monitored process 33 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:52:05,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-10-16 10:52:05,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:52:05,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:05,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 72 conjunts are in the unsatisfiable core [2022-10-16 10:52:05,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:05,730 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:52:06,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:52:06,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:52:06,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:52:06,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:52:08,085 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 21 [2022-10-16 10:52:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 32 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:52:08,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:08,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:52:08,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:52:10,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:10,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 70 [2022-10-16 10:52:10,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:10,305 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 38 treesize of output 34 [2022-10-16 10:52:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-10-16 10:52:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621603789] [2022-10-16 10:52:10,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:52:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126337518] [2022-10-16 10:52:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126337518] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:10,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:52:10,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 57 [2022-10-16 10:52:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251811902] [2022-10-16 10:52:10,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:10,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:52:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:52:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2757, Unknown=4, NotChecked=214, Total=3192 [2022-10-16 10:52:10,795 INFO L87 Difference]: Start difference. First operand 406 states and 473 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 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:52:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:23,090 INFO L93 Difference]: Finished difference Result 461 states and 540 transitions. [2022-10-16 10:52:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-10-16 10:52:23,091 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 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 74 [2022-10-16 10:52:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:23,094 INFO L225 Difference]: With dead ends: 461 [2022-10-16 10:52:23,094 INFO L226 Difference]: Without dead ends: 426 [2022-10-16 10:52:23,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=793, Invalid=7395, Unknown=10, NotChecked=358, Total=8556 [2022-10-16 10:52:23,096 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 133 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1069 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:23,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 624 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 986 Invalid, 0 Unknown, 1069 Unchecked, 0.6s Time] [2022-10-16 10:52:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-10-16 10:52:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 399. [2022-10-16 10:52:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 392 states have (on average 1.1887755102040816) internal successors, (466), 398 states have internal predecessors, (466), 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:52:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 466 transitions. [2022-10-16 10:52:23,140 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 466 transitions. Word has length 74 [2022-10-16 10:52:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:23,140 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 466 transitions. [2022-10-16 10:52:23,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 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:52:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 466 transitions. [2022-10-16 10:52:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 10:52:23,142 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:23,142 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:23,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-10-16 10:52:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-10-16 10:52:23,355 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 445652671, now seen corresponding path program 11 times [2022-10-16 10:52:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387577891] [2022-10-16 10:52:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:52:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 81 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:52:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:24,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387577891] [2022-10-16 10:52:24,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387577891] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:52:24,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484491213] [2022-10-16 10:52:24,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:52:24,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:24,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:24,190 INFO L229 MonitoredProcess]: Starting monitored process 34 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:52:24,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-10-16 10:52:24,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:52:24,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:24,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:52:24,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:52:25,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:52:25,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484491213] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:25,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:52:25,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2022-10-16 10:52:25,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280884706] [2022-10-16 10:52:25,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:25,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:52:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:52:25,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:52:25,850 INFO L87 Difference]: Start difference. First operand 399 states and 466 transitions. Second operand has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 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:52:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:27,967 INFO L93 Difference]: Finished difference Result 618 states and 722 transitions. [2022-10-16 10:52:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-10-16 10:52:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 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 76 [2022-10-16 10:52:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:27,970 INFO L225 Difference]: With dead ends: 618 [2022-10-16 10:52:27,970 INFO L226 Difference]: Without dead ends: 533 [2022-10-16 10:52:27,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 110 SyntacticMatches, 25 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3154 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1265, Invalid=7107, Unknown=0, NotChecked=0, Total=8372 [2022-10-16 10:52:27,972 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 350 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:27,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 427 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:52:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-16 10:52:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 443. [2022-10-16 10:52:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 436 states have (on average 1.1743119266055047) internal successors, (512), 442 states have internal predecessors, (512), 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:52:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 512 transitions. [2022-10-16 10:52:28,018 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 512 transitions. Word has length 76 [2022-10-16 10:52:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 512 transitions. [2022-10-16 10:52:28,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 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:52:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 512 transitions. [2022-10-16 10:52:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:52:28,020 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:28,020 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:28,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-10-16 10:52:28,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-10-16 10:52:28,235 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash 952699344, now seen corresponding path program 10 times [2022-10-16 10:52:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:28,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180429858] [2022-10-16 10:52:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:28,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:52:28,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649587635] [2022-10-16 10:52:28,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:52:28,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:28,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:28,266 INFO L229 MonitoredProcess]: Starting monitored process 35 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:52:28,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-10-16 10:52:28,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:52:28,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:28,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-16 10:52:28,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:28,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:52:29,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:29,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:52:29,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:29,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:52:29,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:29,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:52:29,510 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 19 treesize of output 7 [2022-10-16 10:52:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:52:29,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:29,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:52:29,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:52:29,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:29,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:29,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:52:29,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:52:29,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 4 (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:29,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:29,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:52:29,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:29,814 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 38 treesize of output 34 [2022-10-16 10:52:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:52:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:30,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180429858] [2022-10-16 10:52:30,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:52:30,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649587635] [2022-10-16 10:52:30,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649587635] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:30,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:52:30,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2022-10-16 10:52:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895788027] [2022-10-16 10:52:30,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 10:52:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 10:52:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=994, Unknown=7, NotChecked=490, Total=1640 [2022-10-16 10:52:30,179 INFO L87 Difference]: Start difference. First operand 443 states and 512 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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:52:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:31,490 INFO L93 Difference]: Finished difference Result 565 states and 651 transitions. [2022-10-16 10:52:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 10:52:31,492 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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 77 [2022-10-16 10:52:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:31,495 INFO L225 Difference]: With dead ends: 565 [2022-10-16 10:52:31,495 INFO L226 Difference]: Without dead ends: 532 [2022-10-16 10:52:31,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=226, Invalid=1517, Unknown=7, NotChecked=602, Total=2352 [2022-10-16 10:52:31,496 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 249 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:31,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 650 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1236 Invalid, 0 Unknown, 739 Unchecked, 0.7s Time] [2022-10-16 10:52:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-10-16 10:52:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 488. [2022-10-16 10:52:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 481 states have (on average 1.162162162162162) internal successors, (559), 487 states have internal predecessors, (559), 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:52:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 559 transitions. [2022-10-16 10:52:31,558 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 559 transitions. Word has length 77 [2022-10-16 10:52:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:31,558 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 559 transitions. [2022-10-16 10:52:31,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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:52:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 559 transitions. [2022-10-16 10:52:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:52:31,560 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:31,560 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:31,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-10-16 10:52:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:31,774 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 952699152, now seen corresponding path program 2 times [2022-10-16 10:52:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558835152] [2022-10-16 10:52:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:52:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 10:52:32,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558835152] [2022-10-16 10:52:32,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558835152] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:52:32,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333707592] [2022-10-16 10:52:32,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:52:32,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:32,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:32,606 INFO L229 MonitoredProcess]: Starting monitored process 36 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:52:32,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-10-16 10:52:32,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:52:32,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:32,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:52:32,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:32,785 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:52:32,792 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:52:32,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:32,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:32,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:32,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:32,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:32,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:32,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:33,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:52:33,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:52:33,496 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:52:33,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-10-16 10:52:33,912 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-10-16 10:52:33,912 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 61 [2022-10-16 10:52:34,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:34,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 98 [2022-10-16 10:52:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 10:52:34,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:58,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_289| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_1553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_ArrVal_1556 Int) (v_ArrVal_1555 Int) (v_ArrVal_1558 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1553))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)))) (.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1556)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4)))) (.cse3 (select v_ArrVal_1553 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1555)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_289| 4))))) (or (< 4 .cse0) (< 4 .cse1) (< (+ v_ArrVal_1558 .cse0) 9223372036854775808) (< 4 .cse2) (< 4 .cse3) (< (+ .cse2 v_ArrVal_1556) v_ArrVal_1558) (< (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1555) (< (+ .cse1 v_ArrVal_1555) v_ArrVal_1556)))))) is different from false [2022-10-16 10:53:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 13 not checked. [2022-10-16 10:53:03,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333707592] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:03,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:03,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-10-16 10:53:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056488010] [2022-10-16 10:53:03,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:03,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:53:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:53:03,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1175, Unknown=11, NotChecked=74, Total=1560 [2022-10-16 10:53:03,703 INFO L87 Difference]: Start difference. First operand 488 states and 559 transitions. Second operand has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 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:53:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:10,817 INFO L93 Difference]: Finished difference Result 578 states and 679 transitions. [2022-10-16 10:53:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:53:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 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 77 [2022-10-16 10:53:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:10,820 INFO L225 Difference]: With dead ends: 578 [2022-10-16 10:53:10,820 INFO L226 Difference]: Without dead ends: 577 [2022-10-16 10:53:10,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=671, Invalid=2514, Unknown=11, NotChecked=110, Total=3306 [2022-10-16 10:53:10,821 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 84 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:10,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 369 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 72 Invalid, 0 Unknown, 292 Unchecked, 0.1s Time] [2022-10-16 10:53:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-10-16 10:53:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 540. [2022-10-16 10:53:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 533 states have (on average 1.176360225140713) internal successors, (627), 539 states have internal predecessors, (627), 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:53:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 627 transitions. [2022-10-16 10:53:10,881 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 627 transitions. Word has length 77 [2022-10-16 10:53:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:10,881 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 627 transitions. [2022-10-16 10:53:10,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 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:53:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 627 transitions. [2022-10-16 10:53:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 10:53:10,883 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:10,883 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:10,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-10-16 10:53:11,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-10-16 10:53:11,096 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash -917434056, now seen corresponding path program 11 times [2022-10-16 10:53:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:11,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327758600] [2022-10-16 10:53:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:11,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:53:11,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019695463] [2022-10-16 10:53:11,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:53:11,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:11,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:11,114 INFO L229 MonitoredProcess]: Starting monitored process 37 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:53:11,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-10-16 10:53:11,326 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:53:11,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:11,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:53:11,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 45 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:53:11,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 45 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:53:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:12,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327758600] [2022-10-16 10:53:12,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:53:12,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019695463] [2022-10-16 10:53:12,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019695463] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:12,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:53:12,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2022-10-16 10:53:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296407845] [2022-10-16 10:53:12,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:12,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-16 10:53:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-16 10:53:12,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 10:53:12,313 INFO L87 Difference]: Start difference. First operand 540 states and 627 transitions. Second operand has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 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:53:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:13,333 INFO L93 Difference]: Finished difference Result 756 states and 894 transitions. [2022-10-16 10:53:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 10:53:13,334 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 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 78 [2022-10-16 10:53:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:13,336 INFO L225 Difference]: With dead ends: 756 [2022-10-16 10:53:13,336 INFO L226 Difference]: Without dead ends: 547 [2022-10-16 10:53:13,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2022-10-16 10:53:13,337 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 237 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:13,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 467 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 10:53:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-10-16 10:53:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 489. [2022-10-16 10:53:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 482 states have (on average 1.1721991701244814) internal successors, (565), 488 states have internal predecessors, (565), 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:53:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 565 transitions. [2022-10-16 10:53:13,392 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 565 transitions. Word has length 78 [2022-10-16 10:53:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:13,393 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 565 transitions. [2022-10-16 10:53:13,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 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:53:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 565 transitions. [2022-10-16 10:53:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 10:53:13,394 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:13,394 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:13,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-10-16 10:53:13,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:13,609 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash 744540091, now seen corresponding path program 12 times [2022-10-16 10:53:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:13,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986764287] [2022-10-16 10:53:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:53:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986764287] [2022-10-16 10:53:15,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986764287] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980456661] [2022-10-16 10:53:15,510 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:53:15,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:15,511 INFO L229 MonitoredProcess]: Starting monitored process 38 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:53:15,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-10-16 10:53:16,008 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-16 10:53:16,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:16,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjunts are in the unsatisfiable core [2022-10-16 10:53:16,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:16,091 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 15 treesize of output 11 [2022-10-16 10:53:16,164 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:16,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:16,245 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:16,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:16,379 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:16,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:16,514 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:16,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:16,653 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:16,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:16,794 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:16,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:53:16,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:17,172 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 16 treesize of output 14 [2022-10-16 10:53:17,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:53:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:53:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980456661] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:17,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 44 [2022-10-16 10:53:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919149834] [2022-10-16 10:53:17,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:53:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:53:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2022-10-16 10:53:17,273 INFO L87 Difference]: Start difference. First operand 489 states and 565 transitions. Second operand has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 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:53:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:19,637 INFO L93 Difference]: Finished difference Result 724 states and 867 transitions. [2022-10-16 10:53:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:53:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 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) Word has length 80 [2022-10-16 10:53:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:19,639 INFO L225 Difference]: With dead ends: 724 [2022-10-16 10:53:19,639 INFO L226 Difference]: Without dead ends: 525 [2022-10-16 10:53:19,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 148 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=237, Invalid=3669, Unknown=0, NotChecked=0, Total=3906 [2022-10-16 10:53:19,640 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 137 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:19,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1168 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-16 10:53:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-10-16 10:53:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 503. [2022-10-16 10:53:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 496 states have (on average 1.1713709677419355) internal successors, (581), 502 states have internal predecessors, (581), 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:53:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 581 transitions. [2022-10-16 10:53:19,708 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 581 transitions. Word has length 80 [2022-10-16 10:53:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:19,708 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 581 transitions. [2022-10-16 10:53:19,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 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:53:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 581 transitions. [2022-10-16 10:53:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-16 10:53:19,710 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:19,710 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:19,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-10-16 10:53:19,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:19,923 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1987594419, now seen corresponding path program 12 times [2022-10-16 10:53:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:19,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706338113] [2022-10-16 10:53:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:19,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:53:19,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650177481] [2022-10-16 10:53:19,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:53:19,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:19,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:19,946 INFO L229 MonitoredProcess]: Starting monitored process 39 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:53:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-10-16 10:53:20,326 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:53:20,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:20,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:53:20,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:53:20,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:53:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706338113] [2022-10-16 10:53:21,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:53:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650177481] [2022-10-16 10:53:21,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650177481] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:21,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:53:21,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2022-10-16 10:53:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203590524] [2022-10-16 10:53:21,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:21,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 10:53:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 10:53:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:53:21,200 INFO L87 Difference]: Start difference. First operand 503 states and 581 transitions. Second operand has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 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 10:53:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:21,844 INFO L93 Difference]: Finished difference Result 540 states and 622 transitions. [2022-10-16 10:53:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:53:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 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 84 [2022-10-16 10:53:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:21,852 INFO L225 Difference]: With dead ends: 540 [2022-10-16 10:53:21,852 INFO L226 Difference]: Without dead ends: 451 [2022-10-16 10:53:21,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 128 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2022-10-16 10:53:21,856 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:21,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 380 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:53:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-10-16 10:53:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-10-16 10:53:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 442 states have (on average 1.1877828054298643) internal successors, (525), 448 states have internal predecessors, (525), 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:53:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 525 transitions. [2022-10-16 10:53:21,908 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 525 transitions. Word has length 84 [2022-10-16 10:53:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:21,908 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 525 transitions. [2022-10-16 10:53:21,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 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 10:53:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 525 transitions. [2022-10-16 10:53:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-16 10:53:21,910 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:21,910 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:21,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-10-16 10:53:22,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-10-16 10:53:22,121 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 757864824, now seen corresponding path program 13 times [2022-10-16 10:53:22,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:22,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165402602] [2022-10-16 10:53:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:22,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:53:22,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044553849] [2022-10-16 10:53:22,142 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:53:22,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:22,143 INFO L229 MonitoredProcess]: Starting monitored process 40 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:53:22,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-10-16 10:53:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:22,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 50 conjunts are in the unsatisfiable core [2022-10-16 10:53:22,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:22,305 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:53:22,521 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 37 treesize of output 17 [2022-10-16 10:53:22,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:53:22,633 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 25 treesize of output 24 [2022-10-16 10:53:22,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:53:22,746 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 25 treesize of output 24 [2022-10-16 10:53:22,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:53:22,852 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 25 treesize of output 24 [2022-10-16 10:53:22,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:53:22,956 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 25 treesize of output 24 [2022-10-16 10:53:23,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:53:23,144 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 15 treesize of output 7 [2022-10-16 10:53:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 39 proven. 74 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-16 10:53:23,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:23,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:53:23,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:53:23,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:53:23,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)))) is different from false [2022-10-16 10:53:23,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) is different from false [2022-10-16 10:53:23,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:53:23,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 4 (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_345|)))) is different from false [2022-10-16 10:53:23,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 4 (select (select (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) is different from false [2022-10-16 10:53:23,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) is different from false [2022-10-16 10:53:23,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:53:23,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) is different from false [2022-10-16 10:53:23,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) is different from false [2022-10-16 10:53:23,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_347|)))) is different from false [2022-10-16 10:53:23,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) is different from false [2022-10-16 10:53:23,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) is different from false [2022-10-16 10:53:24,219 INFO L356 Elim1Store]: treesize reduction 364, result has 14.8 percent of original size [2022-10-16 10:53:24,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 79 [2022-10-16 10:53:24,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:53:24,229 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 38 treesize of output 34 [2022-10-16 10:53:24,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-16 10:53:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 111 not checked. [2022-10-16 10:53:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165402602] [2022-10-16 10:53:24,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:53:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044553849] [2022-10-16 10:53:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044553849] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:24,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:53:24,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2022-10-16 10:53:24,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733899052] [2022-10-16 10:53:24,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:24,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:53:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:53:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=804, Unknown=15, NotChecked=1080, Total=2070 [2022-10-16 10:53:24,403 INFO L87 Difference]: Start difference. First operand 449 states and 525 transitions. Second operand has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 46 states have internal predecessors, (124), 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:53:25,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:53:27,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_347|)))) (= (select .cse0 .cse1) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:53:28,925 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:30,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_347|)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:32,964 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:34,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_345|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_347|)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:37,117 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) is different from false [2022-10-16 10:53:39,124 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_345|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_347|)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))) is different from false [2022-10-16 10:53:40,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_345| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse3))) (= (select .cse0 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:42,176 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) is different from false [2022-10-16 10:53:44,196 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_345|)))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))) is different from false [2022-10-16 10:53:46,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) is different from false [2022-10-16 10:53:48,445 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_345|)))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_347|)))) (= (select .cse0 .cse1) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2022-10-16 10:53:49,240 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse3))) (= (select .cse0 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:50,018 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse3))) (= (select .cse0 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:53:51,205 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) is different from false [2022-10-16 10:53:53,224 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1842 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))) is different from false [2022-10-16 10:53:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:53,311 INFO L93 Difference]: Finished difference Result 671 states and 819 transitions. [2022-10-16 10:53:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-16 10:53:53,312 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 46 states have internal predecessors, (124), 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 85 [2022-10-16 10:53:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:53,314 INFO L225 Difference]: With dead ends: 671 [2022-10-16 10:53:53,314 INFO L226 Difference]: Without dead ends: 602 [2022-10-16 10:53:53,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 125 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=236, Invalid=982, Unknown=32, NotChecked=3040, Total=4290 [2022-10-16 10:53:53,315 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1257 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:53,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 599 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 673 Invalid, 0 Unknown, 1257 Unchecked, 0.4s Time] [2022-10-16 10:53:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-10-16 10:53:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 463. [2022-10-16 10:53:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 456 states have (on average 1.1820175438596492) internal successors, (539), 462 states have internal predecessors, (539), 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:53:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 539 transitions. [2022-10-16 10:53:53,378 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 539 transitions. Word has length 85 [2022-10-16 10:53:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:53,378 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 539 transitions. [2022-10-16 10:53:53,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 46 states have internal predecessors, (124), 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:53:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 539 transitions. [2022-10-16 10:53:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 10:53:53,380 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:53,380 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:53,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-10-16 10:53:53,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-10-16 10:53:53,595 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1453671805, now seen corresponding path program 13 times [2022-10-16 10:53:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:53,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133737213] [2022-10-16 10:53:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 118 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:53:54,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:54,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133737213] [2022-10-16 10:53:54,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133737213] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490099105] [2022-10-16 10:53:54,773 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:53:54,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:54,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:54,776 INFO L229 MonitoredProcess]: Starting monitored process 41 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:53:54,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-10-16 10:53:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:54,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:53:54,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 161 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:53:55,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 161 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:53:57,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490099105] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:57,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:57,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2022-10-16 10:53:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209896328] [2022-10-16 10:53:57,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:57,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-16 10:53:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-16 10:53:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2022-10-16 10:53:57,061 INFO L87 Difference]: Start difference. First operand 463 states and 539 transitions. Second operand has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 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:54:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:00,273 INFO L93 Difference]: Finished difference Result 707 states and 825 transitions. [2022-10-16 10:54:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-10-16 10:54:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 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 87 [2022-10-16 10:54:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:00,277 INFO L225 Difference]: With dead ends: 707 [2022-10-16 10:54:00,277 INFO L226 Difference]: Without dead ends: 589 [2022-10-16 10:54:00,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4281 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1715, Invalid=9627, Unknown=0, NotChecked=0, Total=11342 [2022-10-16 10:54:00,280 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 368 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:00,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 474 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:54:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-10-16 10:54:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 507. [2022-10-16 10:54:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 500 states have (on average 1.168) internal successors, (584), 506 states have internal predecessors, (584), 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:54:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 584 transitions. [2022-10-16 10:54:00,342 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 584 transitions. Word has length 87 [2022-10-16 10:54:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:00,342 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 584 transitions. [2022-10-16 10:54:00,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 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:54:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 584 transitions. [2022-10-16 10:54:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-16 10:54:00,344 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:00,344 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:00,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-10-16 10:54:00,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-10-16 10:54:00,559 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1339241884, now seen corresponding path program 14 times [2022-10-16 10:54:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:00,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361912305] [2022-10-16 10:54:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:00,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:54:00,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753165036] [2022-10-16 10:54:00,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:54:00,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:00,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:00,582 INFO L229 MonitoredProcess]: Starting monitored process 42 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:54:00,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-10-16 10:54:00,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:54:00,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:54:00,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:54:00,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:00,745 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:54:00,967 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 37 treesize of output 17 [2022-10-16 10:54:01,097 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:01,097 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 25 treesize of output 24 [2022-10-16 10:54:01,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:01,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:01,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:54:01,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:01,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:54:01,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:01,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:54:01,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:01,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:01,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:01,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:01,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) is different from false [2022-10-16 10:54:01,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2022-10-16 10:54:03,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:54:05,782 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:54:05,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:54:05,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:54:05,790 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 38 treesize of output 34 [2022-10-16 10:54:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 45 trivial. 75 not checked. [2022-10-16 10:54:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:05,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361912305] [2022-10-16 10:54:05,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:54:05,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753165036] [2022-10-16 10:54:05,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753165036] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:05,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:54:05,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2022-10-16 10:54:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763834151] [2022-10-16 10:54:05,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:05,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:54:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:54:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=778, Unknown=10, NotChecked=650, Total=1560 [2022-10-16 10:54:05,915 INFO L87 Difference]: Start difference. First operand 507 states and 584 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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:54:07,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (= 3 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))))) is different from false [2022-10-16 10:54:09,012 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 4) (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2022-10-16 10:54:09,821 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:10,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) is different from false [2022-10-16 10:54:12,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) is different from false [2022-10-16 10:54:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:13,300 INFO L93 Difference]: Finished difference Result 641 states and 741 transitions. [2022-10-16 10:54:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-16 10:54:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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 88 [2022-10-16 10:54:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:13,304 INFO L225 Difference]: With dead ends: 641 [2022-10-16 10:54:13,304 INFO L226 Difference]: Without dead ends: 608 [2022-10-16 10:54:13,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 136 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=203, Invalid=1402, Unknown=15, NotChecked=1350, Total=2970 [2022-10-16 10:54:13,305 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 135 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 981 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:13,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 606 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1132 Invalid, 0 Unknown, 981 Unchecked, 0.7s Time] [2022-10-16 10:54:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-10-16 10:54:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 562. [2022-10-16 10:54:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 555 states have (on average 1.1585585585585585) internal successors, (643), 561 states have internal predecessors, (643), 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:54:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 643 transitions. [2022-10-16 10:54:13,353 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 643 transitions. Word has length 88 [2022-10-16 10:54:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:13,353 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 643 transitions. [2022-10-16 10:54:13,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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:54:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 643 transitions. [2022-10-16 10:54:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 10:54:13,355 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:13,355 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:13,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-10-16 10:54:13,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-10-16 10:54:13,568 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2096094215, now seen corresponding path program 14 times [2022-10-16 10:54:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:13,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654964114] [2022-10-16 10:54:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:15,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654964114] [2022-10-16 10:54:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654964114] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:54:15,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994544417] [2022-10-16 10:54:15,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:54:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:15,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:15,802 INFO L229 MonitoredProcess]: Starting monitored process 43 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:54:15,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-10-16 10:54:15,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:54:15,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:54:15,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 83 conjunts are in the unsatisfiable core [2022-10-16 10:54:15,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:16,056 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 15 treesize of output 11 [2022-10-16 10:54:16,135 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:16,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:16,224 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:16,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:16,364 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:16,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:16,515 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:16,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:16,679 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:16,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:16,850 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:16,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:17,016 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:17,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:17,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:17,466 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 16 treesize of output 14 [2022-10-16 10:54:17,468 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 20 treesize of output 16 [2022-10-16 10:54:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:17,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994544417] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:17,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:54:17,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 50 [2022-10-16 10:54:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952641766] [2022-10-16 10:54:17,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:17,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-16 10:54:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-16 10:54:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2310, Unknown=0, NotChecked=0, Total=2450 [2022-10-16 10:54:17,582 INFO L87 Difference]: Start difference. First operand 562 states and 643 transitions. Second operand has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 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:54:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:20,616 INFO L93 Difference]: Finished difference Result 802 states and 950 transitions. [2022-10-16 10:54:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:54:20,617 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 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 91 [2022-10-16 10:54:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:20,619 INFO L225 Difference]: With dead ends: 802 [2022-10-16 10:54:20,619 INFO L226 Difference]: Without dead ends: 603 [2022-10-16 10:54:20,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=272, Invalid=4840, Unknown=0, NotChecked=0, Total=5112 [2022-10-16 10:54:20,620 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 156 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:20,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1298 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3502 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 10:54:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-10-16 10:54:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 576. [2022-10-16 10:54:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 569 states have (on average 1.1581722319859402) internal successors, (659), 575 states have internal predecessors, (659), 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:54:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 659 transitions. [2022-10-16 10:54:20,688 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 659 transitions. Word has length 91 [2022-10-16 10:54:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:20,688 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 659 transitions. [2022-10-16 10:54:20,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 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:54:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 659 transitions. [2022-10-16 10:54:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 10:54:20,690 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:20,690 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:20,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-10-16 10:54:20,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:20,903 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -852804955, now seen corresponding path program 15 times [2022-10-16 10:54:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:20,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015141408] [2022-10-16 10:54:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:20,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:54:20,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708204137] [2022-10-16 10:54:20,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:54:20,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:20,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:20,924 INFO L229 MonitoredProcess]: Starting monitored process 44 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:54:20,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-10-16 10:54:21,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-16 10:54:21,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:54:21,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-16 10:54:21,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:21,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:54:22,009 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:22,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:22,188 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:22,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:22,383 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:54:22,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:54:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:54:22,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:22,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:54:22,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 19 proven. 103 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-16 10:54:22,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:23,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:54:23,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:23,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:23,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:23,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:23,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int)) (or (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_410|)))) is different from false [2022-10-16 10:54:23,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2022-10-16 10:54:23,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:54:23,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_411|)) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))))) is different from false [2022-10-16 10:54:23,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:54:23,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:54:23,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_412|)))) is different from false [2022-10-16 10:54:23,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_412| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) is different from false [2022-10-16 10:54:23,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) is different from false [2022-10-16 10:54:23,849 INFO L356 Elim1Store]: treesize reduction 203, result has 20.1 percent of original size [2022-10-16 10:54:23,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 67 [2022-10-16 10:54:23,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:54:23,859 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 38 treesize of output 34 [2022-10-16 10:54:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 111 not checked. [2022-10-16 10:54:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015141408] [2022-10-16 10:54:24,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:54:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708204137] [2022-10-16 10:54:24,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708204137] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:24,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:54:24,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2022-10-16 10:54:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255886192] [2022-10-16 10:54:24,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:24,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-16 10:54:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-16 10:54:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1117, Unknown=14, NotChecked=1134, Total=2450 [2022-10-16 10:54:24,229 INFO L87 Difference]: Start difference. First operand 576 states and 659 transitions. Second operand has 50 states, 50 states have (on average 2.78) internal successors, (139), 50 states have internal predecessors, (139), 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:54:25,513 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |v_ULTIMATE.start_main_~i~0#1_412| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))))) is different from false [2022-10-16 10:54:27,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_412|)))) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:54:29,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse2 v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))))) is different from false [2022-10-16 10:54:31,617 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse2))))) is different from false [2022-10-16 10:54:33,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_412|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_411|)) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))))))) is different from false [2022-10-16 10:54:35,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse2 v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse3))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| .cse3))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:37,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_410| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse1 .cse2) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse0))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:39,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_411|)) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int)) (or (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_410|)))))) is different from false [2022-10-16 10:54:41,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse2) 4) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 3)) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))))) is different from false [2022-10-16 10:54:43,207 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_410| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse1 .cse2) 4) (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:45,233 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_412|)))) (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int)) (or (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_410|)))))) is different from false [2022-10-16 10:54:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:45,859 INFO L93 Difference]: Finished difference Result 638 states and 729 transitions. [2022-10-16 10:54:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:54:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.78) internal successors, (139), 50 states have internal predecessors, (139), 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 92 [2022-10-16 10:54:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:45,862 INFO L225 Difference]: With dead ends: 638 [2022-10-16 10:54:45,862 INFO L226 Difference]: Without dead ends: 587 [2022-10-16 10:54:45,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 136 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=268, Invalid=1529, Unknown=25, NotChecked=2600, Total=4422 [2022-10-16 10:54:45,863 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 157 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1219 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:45,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 563 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1014 Invalid, 0 Unknown, 1219 Unchecked, 0.7s Time] [2022-10-16 10:54:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-10-16 10:54:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 519. [2022-10-16 10:54:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 512 states have (on average 1.15625) internal successors, (592), 518 states have internal predecessors, (592), 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:54:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 592 transitions. [2022-10-16 10:54:45,947 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 592 transitions. Word has length 92 [2022-10-16 10:54:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:45,947 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 592 transitions. [2022-10-16 10:54:45,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.78) internal successors, (139), 50 states have internal predecessors, (139), 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:54:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 592 transitions. [2022-10-16 10:54:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 10:54:45,949 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:45,949 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:45,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-10-16 10:54:46,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-10-16 10:54:46,164 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:54:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:46,165 INFO L85 PathProgramCache]: Analyzing trace with hash -315167231, now seen corresponding path program 16 times [2022-10-16 10:54:46,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:46,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274323391] [2022-10-16 10:54:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:46,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:54:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326806976] [2022-10-16 10:54:46,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:54:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:46,185 INFO L229 MonitoredProcess]: Starting monitored process 45 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:54:46,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-10-16 10:54:46,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:54:46,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:54:46,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 55 conjunts are in the unsatisfiable core [2022-10-16 10:54:46,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:47,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:54:47,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:54:47,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:47,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:54:47,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:47,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:54:47,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:48,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:54:48,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:54:48,239 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 19 treesize of output 7 [2022-10-16 10:54:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:54:48,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:48,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-10-16 10:54:48,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 3))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-10-16 10:54:48,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:54:48,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:54:48,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:54:48,696 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 38 treesize of output 34 [2022-10-16 10:54:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 75 not checked. [2022-10-16 10:54:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:49,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274323391] [2022-10-16 10:54:49,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:54:49,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326806976] [2022-10-16 10:54:49,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326806976] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:49,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:54:49,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2022-10-16 10:54:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042945984] [2022-10-16 10:54:49,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:49,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-16 10:54:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:49,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-16 10:54:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1405, Unknown=9, NotChecked=756, Total=2352 [2022-10-16 10:54:49,401 INFO L87 Difference]: Start difference. First operand 519 states and 592 transitions. Second operand has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 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)