/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/s32if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:50:40,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:50:40,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:50:40,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:50:40,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:50:40,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:50:40,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:50:40,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:50:40,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:50:40,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:50:40,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:50:40,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:50:40,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:50:40,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:50:40,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:50:40,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:50:40,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:50:40,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:50:40,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:50:40,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:50:40,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:50:40,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:50:40,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:50:40,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:50:40,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:50:40,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:50:40,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:50:40,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:50:40,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:50:40,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:50:40,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:50:40,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:50:40,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:50:40,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:50:40,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:50:40,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:50:40,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:50:40,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:50:40,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:50:40,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:50:40,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:50:40,316 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:40,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:50:40,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:50:40,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:50:40,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:50:40,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:50:40,350 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:50:40,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:50:40,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:50:40,351 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:50:40,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:50:40,351 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:50:40,352 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:50:40,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:50:40,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:50:40,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:50:40,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:50:40,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:50:40,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:50:40,353 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:50:40,353 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:50:40,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:50:40,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:50:40,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:50:40,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:50:40,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:50:40,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:50:40,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:50:40,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:50:40,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:50:40,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:50:40,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:50:40,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:50:40,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:50:40,357 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:40,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:50:40,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:50:40,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:50:40,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:50:40,764 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:50:40,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s32if.c [2022-10-16 10:50:40,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f49f7b4/5d9055d26a954e44868e0ce7e25303ed/FLAGde8bc164f [2022-10-16 10:50:41,626 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:50:41,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s32if.c [2022-10-16 10:50:41,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f49f7b4/5d9055d26a954e44868e0ce7e25303ed/FLAGde8bc164f [2022-10-16 10:50:41,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f49f7b4/5d9055d26a954e44868e0ce7e25303ed [2022-10-16 10:50:41,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:50:41,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:50:41,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:50:41,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:50:42,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:50:42,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:50:41" (1/1) ... [2022-10-16 10:50:42,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5e2ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:42, skipping insertion in model container [2022-10-16 10:50:42,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:50:41" (1/1) ... [2022-10-16 10:50:42,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:50:42,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:50:42,200 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/s32if.c[588,601] [2022-10-16 10:50:42,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:50:42,239 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:50:42,254 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/s32if.c[588,601] [2022-10-16 10:50:42,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:50:42,285 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:50:42,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:42 WrapperNode [2022-10-16 10:50:42,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:50:42,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:50:42,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:50:42,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:50:42,297 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:42" (1/1) ... [2022-10-16 10:50:42,308 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:42" (1/1) ... [2022-10-16 10:50:42,336 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-10-16 10:50:42,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:50:42,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:50:42,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:50:42,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:50:42,351 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:42" (1/1) ... [2022-10-16 10:50:42,351 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:42" (1/1) ... [2022-10-16 10:50:42,355 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:42" (1/1) ... [2022-10-16 10:50:42,355 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:42" (1/1) ... [2022-10-16 10:50:42,366 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:42" (1/1) ... [2022-10-16 10:50:42,376 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:42" (1/1) ... [2022-10-16 10:50:42,378 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:42" (1/1) ... [2022-10-16 10:50:42,386 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:42" (1/1) ... [2022-10-16 10:50:42,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:50:42,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:50:42,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:50:42,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:50:42,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:42" (1/1) ... [2022-10-16 10:50:42,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:50:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:42,449 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:42,480 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:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:50:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:50:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:50:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:50:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:50:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:50:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:50:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:50:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:50:42,681 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:50:42,685 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:50:43,048 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:50:43,077 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:50:43,077 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 10:50:43,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:50:43 BoogieIcfgContainer [2022-10-16 10:50:43,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:50:43,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:50:43,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:50:43,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:50:43,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:50:41" (1/3) ... [2022-10-16 10:50:43,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc33a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:50:43, skipping insertion in model container [2022-10-16 10:50:43,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:50:42" (2/3) ... [2022-10-16 10:50:43,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc33a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:50:43, skipping insertion in model container [2022-10-16 10:50:43,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:50:43" (3/3) ... [2022-10-16 10:50:43,090 INFO L112 eAbstractionObserver]: Analyzing ICFG s32if.c [2022-10-16 10:50:43,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:50:43,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:50:43,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:50:43,193 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;@71beb59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:50:43,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:50:43,204 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:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:50:43,212 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:43,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:43,213 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:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:50:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:43,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58936614] [2022-10-16 10:50:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:43,431 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:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:43,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58936614] [2022-10-16 10:50:43,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58936614] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:43,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:43,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:50:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772561041] [2022-10-16 10:50:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:43,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:50:43,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:50:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:50:43,485 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:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:43,510 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2022-10-16 10:50:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:50:43,513 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:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:43,524 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:50:43,524 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 10:50:43,528 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:43,533 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:43,535 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:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 10:50:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 10:50:43,574 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:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-16 10:50:43,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2022-10-16 10:50:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:43,578 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-16 10:50:43,578 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:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-16 10:50:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:50:43,579 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:43,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:43,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:50:43,580 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:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:50:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:43,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507158784] [2022-10-16 10:50:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:43,791 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:43,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:43,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507158784] [2022-10-16 10:50:43,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507158784] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:43,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:43,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:50:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202220860] [2022-10-16 10:50:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:43,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:43,796 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:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:43,920 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-10-16 10:50:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:43,921 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:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:43,923 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:50:43,923 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 10:50:43,924 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:43,926 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:43,927 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:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 10:50:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-10-16 10:50:43,937 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:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-16 10:50:43,939 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 8 [2022-10-16 10:50:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:43,939 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-16 10:50:43,940 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:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-16 10:50:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:50:43,941 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:43,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:43,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:50:43,942 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:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 678258903, now seen corresponding path program 1 times [2022-10-16 10:50:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:43,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140816403] [2022-10-16 10:50:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:44,083 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:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:44,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140816403] [2022-10-16 10:50:44,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140816403] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:44,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:44,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:50:44,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804402297] [2022-10-16 10:50:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:44,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:44,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:44,087 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:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:44,218 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-10-16 10:50:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:44,221 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:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:44,222 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:50:44,222 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:50:44,223 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:44,228 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:44,231 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:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:50:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2022-10-16 10:50:44,250 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:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-10-16 10:50:44,254 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2022-10-16 10:50:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:44,256 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-10-16 10:50:44,256 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:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-10-16 10:50:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:50:44,257 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:44,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:44,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:50:44,260 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:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:50:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:44,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928523102] [2022-10-16 10:50:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:44,431 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:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:44,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928523102] [2022-10-16 10:50:44,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928523102] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:44,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182724451] [2022-10-16 10:50:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:44,436 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:44,457 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:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:44,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:44,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:44,579 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:44,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:44,632 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:44,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182724451] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:44,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:44,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:50:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739342180] [2022-10-16 10:50:44,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:44,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:50:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:44,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:50:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:50:44,636 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:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:44,822 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-10-16 10:50:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:50:44,823 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:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:44,826 INFO L225 Difference]: With dead ends: 99 [2022-10-16 10:50:44,826 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 10:50:44,828 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:44,830 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:44,832 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:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 10:50:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2022-10-16 10:50:44,844 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:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-10-16 10:50:44,845 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 12 [2022-10-16 10:50:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:44,846 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-10-16 10:50:44,846 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:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-10-16 10:50:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:50:44,847 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:44,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:44,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 10:50:45,062 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:45,063 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:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:50:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:45,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228327979] [2022-10-16 10:50:45,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:45,297 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:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:45,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228327979] [2022-10-16 10:50:45,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228327979] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103555952] [2022-10-16 10:50:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:45,306 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:45,320 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:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:45,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:45,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:45,412 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:45,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:50:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103555952] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:45,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:50:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:50:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700879625] [2022-10-16 10:50:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:45,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:50:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:45,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:50:45,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:50:45,416 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:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:45,508 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-10-16 10:50:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:50:45,508 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:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:45,510 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:50:45,510 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 10:50:45,511 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:45,512 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:45,513 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:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 10:50:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2022-10-16 10:50:45,520 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:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-16 10:50:45,521 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 13 [2022-10-16 10:50:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:45,522 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-16 10:50:45,522 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:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-16 10:50:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:50:45,523 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:45,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:45,564 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:50:45,738 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:50:45,739 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:50:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:45,740 INFO L85 PathProgramCache]: Analyzing trace with hash -825622317, now seen corresponding path program 1 times [2022-10-16 10:50:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:45,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908574321] [2022-10-16 10:50:45,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:46,092 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:50:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:46,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908574321] [2022-10-16 10:50:46,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908574321] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:46,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015709491] [2022-10-16 10:50:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:46,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:46,094 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:50:46,117 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:50:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:46,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 10:50:46,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:46,219 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:50:46,300 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:50:46,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:46,350 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:50:46,355 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:50:46,368 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:50:46,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015709491] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:46,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:46,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-10-16 10:50:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810586973] [2022-10-16 10:50:46,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:46,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 10:50:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:46,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 10:50:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 10:50:46,371 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:50:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:46,506 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2022-10-16 10:50:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 10:50:46,507 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:50:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:46,508 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:50:46,508 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 10:50:46,509 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:50:46,510 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:50:46,511 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:50:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 10:50:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2022-10-16 10:50:46,518 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:50:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-10-16 10:50:46,519 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2022-10-16 10:50:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:46,520 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-10-16 10:50:46,520 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:50:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-10-16 10:50:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:50:46,521 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:46,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:46,560 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:50:46,737 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:50:46,738 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:50:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -825622509, now seen corresponding path program 1 times [2022-10-16 10:50:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:46,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173048582] [2022-10-16 10:50:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:46,818 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:50:46,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:46,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173048582] [2022-10-16 10:50:46,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173048582] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:46,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:46,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:50:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756358347] [2022-10-16 10:50:46,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:46,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:46,821 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:50:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:46,863 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-10-16 10:50:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:46,863 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:50:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:46,864 INFO L225 Difference]: With dead ends: 63 [2022-10-16 10:50:46,865 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 10:50:46,865 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:50:46,866 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:50:46,867 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:50:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 10:50:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 10:50:46,874 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:50:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-10-16 10:50:46,875 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-10-16 10:50:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:46,876 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-10-16 10:50:46,876 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:50:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-10-16 10:50:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 10:50:46,877 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:46,877 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:50:46,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 10:50:46,878 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:50:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1157615292, now seen corresponding path program 1 times [2022-10-16 10:50:46,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:46,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91030544] [2022-10-16 10:50:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:46,967 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:50:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91030544] [2022-10-16 10:50:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91030544] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:46,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:46,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:50:46,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310558264] [2022-10-16 10:50:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:46,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:46,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:46,971 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:50:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:47,033 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-10-16 10:50:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:47,033 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:50:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:47,034 INFO L225 Difference]: With dead ends: 82 [2022-10-16 10:50:47,034 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:50:47,035 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:47,037 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:50:47,037 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:50:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:50:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-10-16 10:50:47,046 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:50:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-16 10:50:47,047 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2022-10-16 10:50:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:47,047 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-16 10:50:47,047 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:50:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-16 10:50:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 10:50:47,048 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:47,049 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:50:47,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:50:47,049 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:50:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 250320491, now seen corresponding path program 1 times [2022-10-16 10:50:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:47,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845876295] [2022-10-16 10:50:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:47,202 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:50:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:47,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845876295] [2022-10-16 10:50:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845876295] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:47,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880622085] [2022-10-16 10:50:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:47,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:47,209 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:50:47,228 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:50:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:47,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:50:47,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:47,374 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:50:47,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:47,451 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:50:47,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880622085] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:47,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:47,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:50:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711400174] [2022-10-16 10:50:47,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:47,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:50:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:50:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:50:47,454 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:50:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:47,697 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-10-16 10:50:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:50:47,697 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:50:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:47,698 INFO L225 Difference]: With dead ends: 155 [2022-10-16 10:50:47,699 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:50:47,699 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:50:47,700 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:50:47,701 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:50:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:50:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2022-10-16 10:50:47,709 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:50:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-16 10:50:47,710 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2022-10-16 10:50:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:47,711 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-16 10:50:47,711 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:50:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-16 10:50:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:50:47,712 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:47,712 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:50:47,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 10:50:47,927 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:50:47,928 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:50:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash 38416049, now seen corresponding path program 1 times [2022-10-16 10:50:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:47,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192442630] [2022-10-16 10:50:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:47,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:50:47,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546179434] [2022-10-16 10:50:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:47,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:47,959 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:50:47,963 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:50:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:48,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:50:48,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:48,109 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:50:48,159 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:50:48,167 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:50:48,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:48,269 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:50:48,274 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:50:48,275 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:50:48,289 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:50:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:48,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192442630] [2022-10-16 10:50:48,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:50:48,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546179434] [2022-10-16 10:50:48,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546179434] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:48,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:50:48,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-10-16 10:50:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759893087] [2022-10-16 10:50:48,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:48,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:50:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:50:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:50:48,294 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:50:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:48,567 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2022-10-16 10:50:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:50:48,567 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:50:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:48,568 INFO L225 Difference]: With dead ends: 153 [2022-10-16 10:50:48,568 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:50:48,569 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:50:48,570 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:50:48,571 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:50:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:50:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2022-10-16 10:50:48,581 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:50:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-10-16 10:50:48,582 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 23 [2022-10-16 10:50:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:48,582 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-10-16 10:50:48,582 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:50:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-10-16 10:50:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:50:48,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:48,584 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:50:48,620 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:50:48,798 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:50:48,799 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:50:48,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 38415857, now seen corresponding path program 1 times [2022-10-16 10:50:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:48,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291647539] [2022-10-16 10:50:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:49,095 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:50:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291647539] [2022-10-16 10:50:49,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291647539] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:49,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:49,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:50:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285875545] [2022-10-16 10:50:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:49,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:50:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:50:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:50:49,101 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:50:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:49,179 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-10-16 10:50:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:50:49,180 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:50:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:49,182 INFO L225 Difference]: With dead ends: 108 [2022-10-16 10:50:49,182 INFO L226 Difference]: Without dead ends: 106 [2022-10-16 10:50:49,183 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:50:49,185 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:50:49,185 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:50:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-16 10:50:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-10-16 10:50:49,198 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:50:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-10-16 10:50:49,200 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 23 [2022-10-16 10:50:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:49,200 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-10-16 10:50:49,200 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:50:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-10-16 10:50:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:50:49,203 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:49,203 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:49,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 10:50:49,203 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:50:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:50:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:49,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907600903] [2022-10-16 10:50:49,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:49,405 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:50:49,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:49,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907600903] [2022-10-16 10:50:49,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907600903] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:49,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074676868] [2022-10-16 10:50:49,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:50:49,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:49,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:49,409 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:50:49,434 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:50:49,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:50:49,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:49,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:50:49,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:49,542 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:50:49,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:49,589 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:50:49,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074676868] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:49,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:49,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:50:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363110490] [2022-10-16 10:50:49,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:50:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:50:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:50:49,593 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:50:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:49,835 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-10-16 10:50:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:50:49,836 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:50:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:49,837 INFO L225 Difference]: With dead ends: 124 [2022-10-16 10:50:49,837 INFO L226 Difference]: Without dead ends: 123 [2022-10-16 10:50:49,838 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:50:49,839 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:50:49,839 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:50:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-16 10:50:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2022-10-16 10:50:49,848 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:50:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-10-16 10:50:49,848 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 24 [2022-10-16 10:50:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:49,849 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-10-16 10:50:49,849 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:50:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-10-16 10:50:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:50:49,850 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:49,850 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:50:49,890 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:50:50,062 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:50:50,062 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:50:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1920559343, now seen corresponding path program 2 times [2022-10-16 10:50:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:50,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836784203] [2022-10-16 10:50:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:50,388 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:50:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:50,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836784203] [2022-10-16 10:50:50,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836784203] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:50,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094305724] [2022-10-16 10:50:50,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:50:50,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:50,390 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:50:50,401 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:50:50,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:50:50,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:50,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 10:50:50,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:50,508 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:50:50,591 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:50:50,592 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:50:50,643 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:50:50,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:50,704 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:50:50,717 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:50:50,734 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:50:50,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094305724] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:50,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:50,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-10-16 10:50:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968441975] [2022-10-16 10:50:50,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:50:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:50:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:50:50,737 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:50:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:51,030 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-10-16 10:50:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:50:51,031 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:50:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:51,032 INFO L225 Difference]: With dead ends: 156 [2022-10-16 10:50:51,032 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:50:51,032 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:50:51,033 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:50:51,034 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:50:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:50:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-10-16 10:50:51,042 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:50:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-10-16 10:50:51,042 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 25 [2022-10-16 10:50:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:51,043 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-10-16 10:50:51,043 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:50:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-10-16 10:50:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:50:51,044 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:51,044 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:50:51,085 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:50:51,257 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:50:51,257 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:50:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1985602653, now seen corresponding path program 1 times [2022-10-16 10:50:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907813711] [2022-10-16 10:50:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:51,313 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:50:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:51,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907813711] [2022-10-16 10:50:51,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907813711] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:51,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:50:51,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:50:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475513306] [2022-10-16 10:50:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:51,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:50:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:50:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:50:51,315 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:50:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:51,371 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2022-10-16 10:50:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:50:51,371 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:50:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:51,372 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:50:51,372 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:50:51,373 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:51,374 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:50:51,374 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:50:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:50:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-10-16 10:50:51,382 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:50:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-10-16 10:50:51,382 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 26 [2022-10-16 10:50:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:51,383 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-10-16 10:50:51,383 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:50:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-10-16 10:50:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:50:51,384 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:51,384 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:50:51,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:50:51,384 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:50:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2118394144, now seen corresponding path program 1 times [2022-10-16 10:50:51,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:51,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082122524] [2022-10-16 10:50:51,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:51,459 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:50:51,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082122524] [2022-10-16 10:50:51,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082122524] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802775223] [2022-10-16 10:50:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:51,461 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:50:51,466 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:50:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:51,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:51,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:51,551 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:50:51,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:51,597 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:50:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802775223] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:51,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:51,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:50:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683843603] [2022-10-16 10:50:51,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:50:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:50:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:50:51,600 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:50:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:51,766 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2022-10-16 10:50:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:50:51,766 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:50:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:51,767 INFO L225 Difference]: With dead ends: 148 [2022-10-16 10:50:51,767 INFO L226 Difference]: Without dead ends: 147 [2022-10-16 10:50:51,768 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:50:51,769 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:50:51,769 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:50:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-16 10:50:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-10-16 10:50:51,778 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:50:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-10-16 10:50:51,779 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 28 [2022-10-16 10:50:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:51,780 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-10-16 10:50:51,780 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:50:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-10-16 10:50:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:50:51,781 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:51,781 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:50:51,818 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:50:51,995 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:50:51,996 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:50:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1245709113, now seen corresponding path program 1 times [2022-10-16 10:50:51,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:51,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227093603] [2022-10-16 10:50:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:52,075 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:50:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:52,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227093603] [2022-10-16 10:50:52,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227093603] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:52,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933744952] [2022-10-16 10:50:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:52,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:52,078 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:50:52,106 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:50:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:52,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:52,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:52,182 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:50:52,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:50:52,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933744952] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:52,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:50:52,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:50:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289456110] [2022-10-16 10:50:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:50:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:50:52,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:50:52,185 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:50:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:52,265 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-10-16 10:50:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:50:52,265 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:50:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:52,266 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:50:52,267 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:50:52,267 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:50:52,268 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:50:52,268 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:50:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:50:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-10-16 10:50:52,276 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:50:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-10-16 10:50:52,277 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 29 [2022-10-16 10:50:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:52,278 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-10-16 10:50:52,278 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:50:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-10-16 10:50:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:50:52,279 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:52,279 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:50:52,317 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:50:52,492 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:50:52,492 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:50:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 874414924, now seen corresponding path program 1 times [2022-10-16 10:50:52,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:52,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482064241] [2022-10-16 10:50:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:52,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:50:52,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717599104] [2022-10-16 10:50:52,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:52,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:52,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:52,508 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:50:52,512 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:50:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:52,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:50:52,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:52,672 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:50:52,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:52,736 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:50:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:52,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482064241] [2022-10-16 10:50:52,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:50:52,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717599104] [2022-10-16 10:50:52,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717599104] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:52,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:50:52,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:50:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882514897] [2022-10-16 10:50:52,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:52,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:50:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:50:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:50:52,739 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:50:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:52,937 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2022-10-16 10:50:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:50:52,938 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:50:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:52,939 INFO L225 Difference]: With dead ends: 143 [2022-10-16 10:50:52,939 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 10:50:52,939 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:50:52,940 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:50:52,940 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:50:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 10:50:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2022-10-16 10:50:52,947 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:50:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-10-16 10:50:52,948 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 30 [2022-10-16 10:50:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:52,948 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-10-16 10:50:52,948 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:50:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-10-16 10:50:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 10:50:52,949 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:52,949 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:50:52,985 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:50:53,150 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:50:53,150 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:50:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1892149553, now seen corresponding path program 3 times [2022-10-16 10:50:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464893050] [2022-10-16 10:50:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:53,336 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:50:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464893050] [2022-10-16 10:50:53,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464893050] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304355508] [2022-10-16 10:50:53,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:50:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:53,338 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:50:53,354 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:50:53,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:50:53,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:53,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:50:53,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:53,569 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:50:53,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:53,702 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:50:53,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304355508] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:53,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:53,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:50:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681851342] [2022-10-16 10:50:53,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:53,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:50:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:50:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:50:53,705 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:50:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:54,078 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2022-10-16 10:50:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:50:54,079 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:50:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:54,080 INFO L225 Difference]: With dead ends: 238 [2022-10-16 10:50:54,080 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:50:54,081 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:50:54,082 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 204 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:50:54,082 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:50:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:50:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-10-16 10:50:54,092 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:50:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-10-16 10:50:54,093 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 32 [2022-10-16 10:50:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:54,093 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-10-16 10:50:54,093 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:50:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-10-16 10:50:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:50:54,094 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:54,094 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:50:54,130 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:50:54,308 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:50:54,309 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:50:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1277475512, now seen corresponding path program 2 times [2022-10-16 10:50:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:54,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308494452] [2022-10-16 10:50:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:54,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:50:54,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499883053] [2022-10-16 10:50:54,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:50:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:54,339 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:50:54,363 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:50:54,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:50:54,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:54,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:50:54,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:54,506 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:50:54,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:54,585 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:50:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308494452] [2022-10-16 10:50:54,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:50:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499883053] [2022-10-16 10:50:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499883053] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:54,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:50:54,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:50:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077843085] [2022-10-16 10:50:54,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:50:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:50:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:50:54,588 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:50:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:54,817 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-10-16 10:50:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:50:54,818 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:50:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:54,820 INFO L225 Difference]: With dead ends: 187 [2022-10-16 10:50:54,820 INFO L226 Difference]: Without dead ends: 144 [2022-10-16 10:50:54,822 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:50:54,823 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:50:54,824 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:50:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-16 10:50:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-10-16 10:50:54,834 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:50:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:50:54,834 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 34 [2022-10-16 10:50:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:54,835 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:50:54,835 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:50:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:50:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:50:54,836 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:54,836 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:50:54,877 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:50:55,050 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:50:55,051 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:50:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash 315378123, now seen corresponding path program 4 times [2022-10-16 10:50:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:55,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592099872] [2022-10-16 10:50:55,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:55,774 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:50:55,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:55,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592099872] [2022-10-16 10:50:55,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592099872] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:55,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687992815] [2022-10-16 10:50:55,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:50:55,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:55,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:55,777 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:50:55,802 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:50:55,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:50:55,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:55,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:50:55,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:55,945 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:50:56,017 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:50:56,018 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:50:56,091 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:50:56,091 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:50:56,168 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:50:56,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:56,327 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:50:56,330 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:50:56,356 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:50:56,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687992815] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:56,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:56,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-10-16 10:50:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508192684] [2022-10-16 10:50:56,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:56,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:50:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:50:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:50:56,359 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:50:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:57,097 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-10-16 10:50:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:50:57,098 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:50:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:57,099 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:50:57,099 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 10:50:57,100 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:50:57,101 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:57,102 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.5s Time] [2022-10-16 10:50:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 10:50:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-10-16 10:50:57,112 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:50:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2022-10-16 10:50:57,113 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2022-10-16 10:50:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:57,113 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2022-10-16 10:50:57,113 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:50:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2022-10-16 10:50:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:50:57,114 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:57,114 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:50:57,155 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:50:57,328 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:50:57,328 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:50:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1855075176, now seen corresponding path program 3 times [2022-10-16 10:50:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166375195] [2022-10-16 10:50:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:57,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:50:57,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332964359] [2022-10-16 10:50:57,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:50:57,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:57,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:57,346 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:50:57,367 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:50:57,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:50:57,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:57,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-16 10:50:57,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:57,444 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:50:57,610 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 31 treesize of output 15 [2022-10-16 10:50:57,697 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:50:57,791 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:50:57,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:57,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array Int Int))) (= 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|) (+ (* |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:50:57,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array Int Int))) (= 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:50:57,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (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_467) |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:50:57,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:57,970 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:50:57,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:57,978 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:50:57,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-16 10:50:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2022-10-16 10:50:58,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166375195] [2022-10-16 10:50:58,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:50:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332964359] [2022-10-16 10:50:58,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332964359] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:58,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:50:58,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-10-16 10:50:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535679091] [2022-10-16 10:50:58,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:58,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-16 10:50:58,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-16 10:50:58,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=427, Unknown=3, NotChecked=132, Total=650 [2022-10-16 10:50:58,108 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 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:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:58,556 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-10-16 10:50:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:50:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 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) Word has length 41 [2022-10-16 10:50:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:58,558 INFO L225 Difference]: With dead ends: 209 [2022-10-16 10:50:58,558 INFO L226 Difference]: Without dead ends: 182 [2022-10-16 10:50:58,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=581, Unknown=3, NotChecked=156, Total=870 [2022-10-16 10:50:58,560 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 208 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:58,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 334 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 0 Unknown, 284 Unchecked, 0.3s Time] [2022-10-16 10:50:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-16 10:50:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2022-10-16 10:50:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 144 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2022-10-16 10:50:58,572 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 41 [2022-10-16 10:50:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:58,572 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2022-10-16 10:50:58,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 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:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2022-10-16 10:50:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:50:58,573 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:58,573 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:50:58,615 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:50:58,788 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:50:58,789 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:50:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1855074984, now seen corresponding path program 1 times [2022-10-16 10:50:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:58,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976977592] [2022-10-16 10:50:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:59,195 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:50:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:59,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976977592] [2022-10-16 10:50:59,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976977592] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:59,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21997644] [2022-10-16 10:50:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:59,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:59,198 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:50:59,208 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:50:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:59,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-16 10:50:59,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:59,293 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:50:59,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:50:59,316 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:50:59,336 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:50:59,373 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:50:59,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 14 treesize of output 16 [2022-10-16 10:50:59,539 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:50:59,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:59,670 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 56 treesize of output 28 [2022-10-16 10:50:59,696 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:50:59,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:01,612 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_85| 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_85| 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:02,216 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:02,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21997644] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:02,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:02,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-10-16 10:51:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398346411] [2022-10-16 10:51:02,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:02,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:51:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:51:02,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=324, Unknown=2, NotChecked=38, Total=462 [2022-10-16 10:51:02,220 INFO L87 Difference]: Start difference. First operand 145 states and 169 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:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:02,411 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-10-16 10:51:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:51:02,411 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:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:02,413 INFO L225 Difference]: With dead ends: 178 [2022-10-16 10:51:02,413 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 10:51:02,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=136, Invalid=418, Unknown=2, NotChecked=44, Total=600 [2022-10-16 10:51:02,414 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 59 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:02,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 260 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2022-10-16 10:51:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 10:51:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2022-10-16 10:51:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 167 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2022-10-16 10:51:02,427 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 41 [2022-10-16 10:51:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:02,428 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2022-10-16 10:51:02,428 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:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2022-10-16 10:51:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:51:02,429 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:02,429 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:02,470 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:02,640 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:02,640 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:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:02,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1672749764, now seen corresponding path program 1 times [2022-10-16 10:51:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:02,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099527498] [2022-10-16 10:51:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:02,841 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:02,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:02,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099527498] [2022-10-16 10:51:02,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099527498] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:02,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842599582] [2022-10-16 10:51:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:02,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:02,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:02,843 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:02,862 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:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:02,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 10:51:02,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:02,928 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:02,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:02,966 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:02,987 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:02,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:51:02,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842599582] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:02,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:51:02,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-10-16 10:51:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360157602] [2022-10-16 10:51:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:02,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:51:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:02,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:51:02,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:51:02,989 INFO L87 Difference]: Start difference. First operand 168 states and 203 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:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:03,071 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2022-10-16 10:51:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:51:03,071 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:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:03,073 INFO L225 Difference]: With dead ends: 168 [2022-10-16 10:51:03,073 INFO L226 Difference]: Without dead ends: 167 [2022-10-16 10:51:03,073 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:03,074 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:03,075 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:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-16 10:51:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-10-16 10:51:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 158 states have (on average 1.259493670886076) internal successors, (199), 166 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2022-10-16 10:51:03,089 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 42 [2022-10-16 10:51:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:03,089 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2022-10-16 10:51:03,090 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:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2022-10-16 10:51:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:51:03,091 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:03,091 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:03,135 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:03,304 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:03,304 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:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435661, now seen corresponding path program 5 times [2022-10-16 10:51:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:03,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859681847] [2022-10-16 10:51:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:03,600 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:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859681847] [2022-10-16 10:51:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859681847] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982600304] [2022-10-16 10:51:03,601 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:51:03,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:03,602 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:03,621 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:03,696 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:51:03,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:03,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:51:03,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:03,922 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:03,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:04,115 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:04,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982600304] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:04,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:04,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:51:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395383145] [2022-10-16 10:51:04,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:04,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:51:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:51:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:51:04,118 INFO L87 Difference]: Start difference. First operand 167 states and 199 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:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:04,665 INFO L93 Difference]: Finished difference Result 316 states and 376 transitions. [2022-10-16 10:51:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:51:04,666 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:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:04,667 INFO L225 Difference]: With dead ends: 316 [2022-10-16 10:51:04,668 INFO L226 Difference]: Without dead ends: 241 [2022-10-16 10:51:04,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:51:04,673 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 228 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:04,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 329 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:51:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-10-16 10:51:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 204. [2022-10-16 10:51:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 195 states have (on average 1.2256410256410257) internal successors, (239), 203 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2022-10-16 10:51:04,694 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 43 [2022-10-16 10:51:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:04,694 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2022-10-16 10:51:04,695 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:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2022-10-16 10:51:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:51:04,695 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:04,696 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:04,743 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:04,907 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:04,907 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:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1194758214, now seen corresponding path program 1 times [2022-10-16 10:51:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:04,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684342308] [2022-10-16 10:51:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:04,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,033 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:05,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:05,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684342308] [2022-10-16 10:51:05,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684342308] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:05,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002175536] [2022-10-16 10:51:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:05,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:05,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:05,035 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:05,055 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:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:51:05,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:05,172 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:05,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:05,220 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:05,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002175536] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:05,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:05,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:51:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212634868] [2022-10-16 10:51:05,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:51:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:51:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:51:05,223 INFO L87 Difference]: Start difference. First operand 204 states and 239 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:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:05,374 INFO L93 Difference]: Finished difference Result 278 states and 332 transitions. [2022-10-16 10:51:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:51:05,375 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:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:05,377 INFO L225 Difference]: With dead ends: 278 [2022-10-16 10:51:05,377 INFO L226 Difference]: Without dead ends: 277 [2022-10-16 10:51:05,377 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:05,378 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 93 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:05,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 142 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-10-16 10:51:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 252. [2022-10-16 10:51:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 243 states have (on average 1.2921810699588476) internal successors, (314), 251 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:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 314 transitions. [2022-10-16 10:51:05,406 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 314 transitions. Word has length 44 [2022-10-16 10:51:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:05,406 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 314 transitions. [2022-10-16 10:51:05,407 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:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2022-10-16 10:51:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:51:05,408 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:05,408 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:05,455 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:05,621 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:05,621 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:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1617200910, now seen corresponding path program 1 times [2022-10-16 10:51:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:05,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567337396] [2022-10-16 10:51:05,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,714 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:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:05,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567337396] [2022-10-16 10:51:05,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567337396] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:05,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818378179] [2022-10-16 10:51:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:05,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:05,716 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:05,737 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:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:51:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:05,830 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:05,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:51:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818378179] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:51:05,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:51:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:51:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216667233] [2022-10-16 10:51:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:51:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:51:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:51:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:51:05,833 INFO L87 Difference]: Start difference. First operand 252 states and 314 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:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:05,917 INFO L93 Difference]: Finished difference Result 254 states and 314 transitions. [2022-10-16 10:51:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:51:05,918 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:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:05,919 INFO L225 Difference]: With dead ends: 254 [2022-10-16 10:51:05,920 INFO L226 Difference]: Without dead ends: 253 [2022-10-16 10:51:05,920 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:05,922 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:05,924 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:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-10-16 10:51:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2022-10-16 10:51:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 250 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2022-10-16 10:51:05,943 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 45 [2022-10-16 10:51:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:05,944 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2022-10-16 10:51:05,944 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:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2022-10-16 10:51:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:51:05,945 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:05,945 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:05,986 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:06,158 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:06,159 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:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 411246071, now seen corresponding path program 6 times [2022-10-16 10:51:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:06,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744955966] [2022-10-16 10:51:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:07,163 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:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:07,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744955966] [2022-10-16 10:51:07,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744955966] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:07,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42737710] [2022-10-16 10:51:07,164 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:51:07,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:07,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:07,166 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:07,189 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:07,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:51:07,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:07,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:51:07,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:07,415 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:07,486 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:07,486 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:07,570 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:07,570 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:07,658 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:07,658 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:07,757 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:07,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:07,997 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:07,999 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:08,036 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:08,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42737710] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:08,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:08,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2022-10-16 10:51:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146953368] [2022-10-16 10:51:08,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:08,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:51:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:51:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2022-10-16 10:51:08,039 INFO L87 Difference]: Start difference. First operand 251 states and 306 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:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:09,203 INFO L93 Difference]: Finished difference Result 329 states and 403 transitions. [2022-10-16 10:51:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:51:09,204 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:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:09,206 INFO L225 Difference]: With dead ends: 329 [2022-10-16 10:51:09,206 INFO L226 Difference]: Without dead ends: 261 [2022-10-16 10:51:09,207 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:09,209 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 115 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:09,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 958 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:51:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-10-16 10:51:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2022-10-16 10:51:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 239 states have (on average 1.2510460251046025) internal successors, (299), 246 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have 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,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 299 transitions. [2022-10-16 10:51:09,231 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 299 transitions. Word has length 47 [2022-10-16 10:51:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:09,231 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 299 transitions. [2022-10-16 10:51:09,231 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:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 299 transitions. [2022-10-16 10:51:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 10:51:09,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:09,232 INFO L195 NwaCegarLoop]: trace histogram [3, 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:09,282 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:09,446 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:09,446 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1384049995, now seen corresponding path program 4 times [2022-10-16 10:51:09,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:09,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170126314] [2022-10-16 10:51:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:09,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:09,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130117076] [2022-10-16 10:51:09,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:51:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:09,465 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:09,482 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:09,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:51:09,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:09,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:51:09,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:51:09,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:51:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170126314] [2022-10-16 10:51:09,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130117076] [2022-10-16 10:51:09,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130117076] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:09,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:09,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-10-16 10:51:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788204795] [2022-10-16 10:51:09,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:09,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:51:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:51:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:51:09,837 INFO L87 Difference]: Start difference. First operand 247 states and 299 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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:51:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:10,138 INFO L93 Difference]: Finished difference Result 294 states and 352 transitions. [2022-10-16 10:51:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:51:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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) Word has length 48 [2022-10-16 10:51:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:10,140 INFO L225 Difference]: With dead ends: 294 [2022-10-16 10:51:10,140 INFO L226 Difference]: Without dead ends: 233 [2022-10-16 10:51:10,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:51:10,142 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:10,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 261 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-16 10:51:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-10-16 10:51:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 223 states have (on average 1.2645739910313902) internal successors, (282), 230 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 282 transitions. [2022-10-16 10:51:10,159 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 282 transitions. Word has length 48 [2022-10-16 10:51:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:10,160 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 282 transitions. [2022-10-16 10:51:10,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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:51:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 282 transitions. [2022-10-16 10:51:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 10:51:10,161 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:10,161 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:10,198 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:10,368 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:10,369 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 377560238, now seen corresponding path program 1 times [2022-10-16 10:51:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:10,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091673596] [2022-10-16 10:51:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:10,459 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:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:10,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091673596] [2022-10-16 10:51:10,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091673596] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:10,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920214935] [2022-10-16 10:51:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:10,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:10,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:10,465 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:10,496 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:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:10,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 10:51:10,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:10,676 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:10,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:10,870 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:10,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920214935] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:10,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:10,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 24 [2022-10-16 10:51:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764221922] [2022-10-16 10:51:10,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:10,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:51:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:10,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:51:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:51:10,875 INFO L87 Difference]: Start difference. First operand 231 states and 282 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:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:11,414 INFO L93 Difference]: Finished difference Result 527 states and 631 transitions. [2022-10-16 10:51:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-10-16 10:51:11,415 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:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:11,418 INFO L225 Difference]: With dead ends: 527 [2022-10-16 10:51:11,418 INFO L226 Difference]: Without dead ends: 520 [2022-10-16 10:51:11,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2022-10-16 10:51:11,420 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 435 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:11,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 322 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-10-16 10:51:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 309. [2022-10-16 10:51:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 301 states have (on average 1.2524916943521596) internal successors, (377), 308 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have 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,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 377 transitions. [2022-10-16 10:51:11,447 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 377 transitions. Word has length 49 [2022-10-16 10:51:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:11,448 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 377 transitions. [2022-10-16 10:51:11,448 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:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 377 transitions. [2022-10-16 10:51:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:51:11,449 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:11,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:11,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-10-16 10:51:11,663 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:11,663 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 497536433, now seen corresponding path program 5 times [2022-10-16 10:51:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:11,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713289899] [2022-10-16 10:51:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:11,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919290152] [2022-10-16 10:51:11,681 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:51:11,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:11,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:11,682 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:11,685 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:11,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:51:11,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:11,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:51:11,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-16 10:51:11,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-16 10:51:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713289899] [2022-10-16 10:51:12,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919290152] [2022-10-16 10:51:12,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919290152] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:12,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:12,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-10-16 10:51:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207472569] [2022-10-16 10:51:12,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:12,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:51:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:12,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:51:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:51:12,102 INFO L87 Difference]: Start difference. First operand 309 states and 377 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:12,443 INFO L93 Difference]: Finished difference Result 380 states and 468 transitions. [2022-10-16 10:51:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:51:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:12,445 INFO L225 Difference]: With dead ends: 380 [2022-10-16 10:51:12,445 INFO L226 Difference]: Without dead ends: 291 [2022-10-16 10:51:12,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:51:12,447 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 159 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:12,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 232 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-10-16 10:51:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2022-10-16 10:51:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 281 states have (on average 1.2597864768683273) internal successors, (354), 288 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 354 transitions. [2022-10-16 10:51:12,470 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 354 transitions. Word has length 52 [2022-10-16 10:51:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:12,471 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 354 transitions. [2022-10-16 10:51:12,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have 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:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 354 transitions. [2022-10-16 10:51:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:51:12,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:12,472 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:12,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:12,685 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:12,685 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:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 522181700, now seen corresponding path program 6 times [2022-10-16 10:51:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:12,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324862732] [2022-10-16 10:51:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:12,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867740132] [2022-10-16 10:51:12,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:51:12,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:12,724 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:12,746 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:12,848 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-10-16 10:51:12,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:12,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-16 10:51:12,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:12,861 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:13,147 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 31 treesize of output 15 [2022-10-16 10:51:13,225 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-16 10:51:13,225 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 30 [2022-10-16 10:51:13,406 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:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:13,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:13,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_881) |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:13,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_881) |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:13,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_879 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|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_879)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_881) |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:51:13,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_ArrVal_881 (Array Int Int)) (v_ArrVal_879 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_145| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_879)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_881) |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_145| 1) c_~N~0))) is different from false [2022-10-16 10:51:13,945 INFO L356 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2022-10-16 10:51:13,946 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 52 [2022-10-16 10:51:13,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:13,956 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 47 treesize of output 43 [2022-10-16 10:51:13,988 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:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-10-16 10:51:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324862732] [2022-10-16 10:51:14,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867740132] [2022-10-16 10:51:14,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867740132] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:14,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:14,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-10-16 10:51:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449137716] [2022-10-16 10:51:14,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:14,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:51:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:51:14,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1370, Unknown=4, NotChecked=316, Total=1892 [2022-10-16 10:51:14,362 INFO L87 Difference]: Start difference. First operand 289 states and 354 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:16,763 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 ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_879 Int)) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_879)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (< 0 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse1) 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:18,767 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 ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_881 (Array Int Int)) (v_ArrVal_879 Int)) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_879)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (= (select .cse0 .cse1) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:51:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:19,260 INFO L93 Difference]: Finished difference Result 396 states and 494 transitions. [2022-10-16 10:51:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:51:19,261 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 52 [2022-10-16 10:51:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:19,263 INFO L225 Difference]: With dead ends: 396 [2022-10-16 10:51:19,263 INFO L226 Difference]: Without dead ends: 327 [2022-10-16 10:51:19,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=343, Invalid=2225, Unknown=6, NotChecked=618, Total=3192 [2022-10-16 10:51:19,266 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:19,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 490 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 788 Invalid, 0 Unknown, 413 Unchecked, 0.4s Time] [2022-10-16 10:51:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-10-16 10:51:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 309. [2022-10-16 10:51:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 301 states have (on average 1.2425249169435215) internal successors, (374), 308 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have 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,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 374 transitions. [2022-10-16 10:51:19,297 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 374 transitions. Word has length 52 [2022-10-16 10:51:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:19,298 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 374 transitions. [2022-10-16 10:51:19,298 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:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-10-16 10:51:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 10:51:19,305 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:19,305 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:19,348 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:19,520 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:19,520 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:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash 819079367, now seen corresponding path program 7 times [2022-10-16 10:51:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:19,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736063452] [2022-10-16 10:51:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:19,909 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:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:19,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736063452] [2022-10-16 10:51:19,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736063452] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:19,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289054060] [2022-10-16 10:51:19,910 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:51:19,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:19,911 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:19,932 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:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:20,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:51:20,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:20,298 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:20,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:20,553 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:20,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289054060] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:20,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2022-10-16 10:51:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452776576] [2022-10-16 10:51:20,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:20,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:51:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:51:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:51:20,556 INFO L87 Difference]: Start difference. First operand 309 states and 374 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:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:21,323 INFO L93 Difference]: Finished difference Result 490 states and 591 transitions. [2022-10-16 10:51:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 10:51:21,324 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:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:21,326 INFO L225 Difference]: With dead ends: 490 [2022-10-16 10:51:21,326 INFO L226 Difference]: Without dead ends: 404 [2022-10-16 10:51:21,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=490, Invalid=2590, Unknown=0, NotChecked=0, Total=3080 [2022-10-16 10:51:21,328 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 239 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:21,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 502 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:51:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-10-16 10:51:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 339. [2022-10-16 10:51:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 331 states have (on average 1.2235649546827794) internal successors, (405), 338 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 405 transitions. [2022-10-16 10:51:21,358 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 405 transitions. Word has length 54 [2022-10-16 10:51:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:21,359 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 405 transitions. [2022-10-16 10:51:21,359 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:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 405 transitions. [2022-10-16 10:51:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:51:21,360 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:21,360 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:21,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:21,575 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:21,575 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -970475837, now seen corresponding path program 8 times [2022-10-16 10:51:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:21,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136074948] [2022-10-16 10:51:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:22,603 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:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136074948] [2022-10-16 10:51:22,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136074948] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:22,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419121217] [2022-10-16 10:51:22,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:22,610 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:22,610 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:22,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:22,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:22,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:51:22,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:22,779 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:22,832 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:22,832 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:22,898 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:22,898 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:22,987 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:22,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, 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:23,085 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:23,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, 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:23,205 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:23,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:23,347 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:23,349 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:23,406 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:23,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419121217] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:23,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:23,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 32 [2022-10-16 10:51:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740900659] [2022-10-16 10:51:23,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:23,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:51:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:51:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:51:23,409 INFO L87 Difference]: Start difference. First operand 339 states and 405 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:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:24,677 INFO L93 Difference]: Finished difference Result 491 states and 605 transitions. [2022-10-16 10:51:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:51:24,683 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:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:24,690 INFO L225 Difference]: With dead ends: 491 [2022-10-16 10:51:24,694 INFO L226 Difference]: Without dead ends: 373 [2022-10-16 10:51:24,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:51:24,698 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 94 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:24,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 852 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 10:51:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-10-16 10:51:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 345. [2022-10-16 10:51:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 337 states have (on average 1.225519287833828) internal successors, (413), 344 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 413 transitions. [2022-10-16 10:51:24,731 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 413 transitions. Word has length 58 [2022-10-16 10:51:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:24,732 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 413 transitions. [2022-10-16 10:51:24,732 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:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 413 transitions. [2022-10-16 10:51:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:51:24,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:24,733 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:24,772 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:24,946 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:24,946 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1085736359, now seen corresponding path program 7 times [2022-10-16 10:51:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:24,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556674019] [2022-10-16 10:51:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:24,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:24,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029124430] [2022-10-16 10:51:24,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:51:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:24,965 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:24,982 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:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:25,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:51:25,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:25,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:51:25,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:51:25,364 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,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:51:25,473 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,543 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:51:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:51:25,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:25,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1037) |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,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1037) |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:25,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1037) |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:25,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1037) |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:25,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (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_1037) |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:25,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:25,767 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:51:25,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:25,777 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:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 24 not checked. [2022-10-16 10:51:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:25,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556674019] [2022-10-16 10:51:25,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:25,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029124430] [2022-10-16 10:51:25,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029124430] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:25,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:25,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2022-10-16 10:51:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809137517] [2022-10-16 10:51:25,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:25,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 10:51:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 10:51:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=655, Unknown=5, NotChecked=280, Total=1056 [2022-10-16 10:51:25,991 INFO L87 Difference]: Start difference. First operand 345 states and 413 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:26,816 INFO L93 Difference]: Finished difference Result 466 states and 568 transitions. [2022-10-16 10:51:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:51:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 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:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:26,819 INFO L225 Difference]: With dead ends: 466 [2022-10-16 10:51:26,819 INFO L226 Difference]: Without dead ends: 415 [2022-10-16 10:51:26,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=962, Unknown=5, NotChecked=340, Total=1482 [2022-10-16 10:51:26,821 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 203 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:26,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 517 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 842 Invalid, 0 Unknown, 553 Unchecked, 0.5s Time] [2022-10-16 10:51:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-10-16 10:51:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 359. [2022-10-16 10:51:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 351 states have (on average 1.2193732193732194) internal successors, (428), 358 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have 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:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 428 transitions. [2022-10-16 10:51:26,856 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 428 transitions. Word has length 59 [2022-10-16 10:51:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:26,856 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 428 transitions. [2022-10-16 10:51:26,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 428 transitions. [2022-10-16 10:51:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:51:26,857 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:26,857 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:26,893 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:27,071 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:27,072 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2026433844, now seen corresponding path program 2 times [2022-10-16 10:51:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:27,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014658550] [2022-10-16 10:51:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:27,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:27,248 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:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014658550] [2022-10-16 10:51:27,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014658550] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849652526] [2022-10-16 10:51:27,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:27,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:27,250 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:27,270 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:27,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:51:27,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:27,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:51:27,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:27,433 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:27,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:27,519 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:27,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849652526] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:27,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:27,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:51:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794219836] [2022-10-16 10:51:27,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:27,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:51:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:51:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:51:27,521 INFO L87 Difference]: Start difference. First operand 359 states and 428 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:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:27,785 INFO L93 Difference]: Finished difference Result 377 states and 448 transitions. [2022-10-16 10:51:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:51:27,785 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:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:27,788 INFO L225 Difference]: With dead ends: 377 [2022-10-16 10:51:27,788 INFO L226 Difference]: Without dead ends: 376 [2022-10-16 10:51:27,788 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:27,789 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 137 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:27,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 110 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:51:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-10-16 10:51:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 358. [2022-10-16 10:51:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 351 states have (on average 1.207977207977208) internal successors, (424), 357 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 424 transitions. [2022-10-16 10:51:27,825 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 424 transitions. Word has length 61 [2022-10-16 10:51:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:27,825 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 424 transitions. [2022-10-16 10:51:27,825 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:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 424 transitions. [2022-10-16 10:51:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:51:27,827 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:27,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:27,865 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:28,041 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:28,042 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2115970960, now seen corresponding path program 8 times [2022-10-16 10:51:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:28,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964758227] [2022-10-16 10:51:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:28,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:28,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965043027] [2022-10-16 10:51:28,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:28,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:28,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:28,065 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:28,086 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:28,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:28,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:28,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-16 10:51:28,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:28,188 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:28,366 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:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:51:28,478 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:51:28,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:51:28,578 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:51:28,664 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:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:51:28,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:28,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:28,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:51:28,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 Int) (v_ArrVal_1150 (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_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:28,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_199|)) (forall ((v_ArrVal_1149 Int) (v_ArrVal_1150 (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:28,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |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_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:28,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:51:28,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_200|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:29,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int) (|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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:29,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int) (|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| (+ |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|) (+ (* |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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)))) is different from false [2022-10-16 10:51:29,167 INFO L356 Elim1Store]: treesize reduction 94, result has 29.3 percent of original size [2022-10-16 10:51:29,167 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 4 case distinctions, treesize of input 61 treesize of output 55 [2022-10-16 10:51:29,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:29,176 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:29,179 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:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:51:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:29,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964758227] [2022-10-16 10:51:29,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:29,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965043027] [2022-10-16 10:51:29,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965043027] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:29,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:29,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2022-10-16 10:51:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104400815] [2022-10-16 10:51:29,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:29,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-10-16 10:51:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-10-16 10:51:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=651, Unknown=9, NotChecked=540, Total=1332 [2022-10-16 10:51:29,320 INFO L87 Difference]: Start difference. First operand 358 states and 424 transitions. Second operand has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 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:30,158 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) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int) (|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:51:32,162 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_200| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_200|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) (= (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:51:33,218 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_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| .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_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int) (|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) is different from false [2022-10-16 10:51:35,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 (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_199|)) (forall ((v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int 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_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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|)) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_200|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:51:36,408 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_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| .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_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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_1150 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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_200| Int) (|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) is different from false [2022-10-16 10:51:38,423 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_199| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_199|)) (forall ((v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int 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_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |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_1150 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_200| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_200|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_199| Int) (v_ArrVal_1147 Int) (v_ArrVal_1149 Int) (v_ArrVal_1150 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_199| (+ |v_ULTIMATE.start_main_~i~0#1_200| 1)) (= (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_200| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1147) (+ (* |v_ULTIMATE.start_main_~i~0#1_199| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1149)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) (= (select .cse1 .cse2) 4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:51:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:38,706 INFO L93 Difference]: Finished difference Result 432 states and 519 transitions. [2022-10-16 10:51:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:51:38,706 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 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 63 [2022-10-16 10:51:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:38,709 INFO L225 Difference]: With dead ends: 432 [2022-10-16 10:51:38,709 INFO L226 Difference]: Without dead ends: 363 [2022-10-16 10:51:38,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 89 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=186, Invalid=851, Unknown=15, NotChecked=1110, Total=2162 [2022-10-16 10:51:38,710 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 152 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 723 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:38,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 407 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 674 Invalid, 0 Unknown, 723 Unchecked, 0.4s Time] [2022-10-16 10:51:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-10-16 10:51:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 354. [2022-10-16 10:51:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 347 states have (on average 1.1873198847262247) internal successors, (412), 353 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have 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:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 412 transitions. [2022-10-16 10:51:38,744 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 412 transitions. Word has length 63 [2022-10-16 10:51:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:38,745 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 412 transitions. [2022-10-16 10:51:38,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 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:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 412 transitions. [2022-10-16 10:51:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 10:51:38,746 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:38,746 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:38,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-10-16 10:51:38,961 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:38,961 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:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash 482497147, now seen corresponding path program 9 times [2022-10-16 10:51:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:38,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534247993] [2022-10-16 10:51:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:39,488 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:39,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534247993] [2022-10-16 10:51:39,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534247993] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826965781] [2022-10-16 10:51:39,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:51:39,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:39,491 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:39,492 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:39,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:51:39,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:39,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:51:39,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:40,127 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:40,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:40,550 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:40,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826965781] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:40,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:40,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2022-10-16 10:51:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444630022] [2022-10-16 10:51:40,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:51:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:51:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:51:40,554 INFO L87 Difference]: Start difference. First operand 354 states and 412 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:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:41,850 INFO L93 Difference]: Finished difference Result 539 states and 624 transitions. [2022-10-16 10:51:41,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-16 10:51:41,851 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:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:41,854 INFO L225 Difference]: With dead ends: 539 [2022-10-16 10:51:41,854 INFO L226 Difference]: Without dead ends: 456 [2022-10-16 10:51:41,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 94 SyntacticMatches, 21 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2193 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=893, Invalid=4959, Unknown=0, NotChecked=0, Total=5852 [2022-10-16 10:51:41,857 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 302 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:41,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 339 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:51:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-10-16 10:51:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 384. [2022-10-16 10:51:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 377 states have (on average 1.1777188328912467) internal successors, (444), 383 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have 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:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 444 transitions. [2022-10-16 10:51:41,893 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 444 transitions. Word has length 65 [2022-10-16 10:51:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:41,893 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 444 transitions. [2022-10-16 10:51:41,893 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:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 444 transitions. [2022-10-16 10:51:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 10:51:41,895 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:41,895 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:41,931 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:42,110 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:42,110 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:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 934988452, now seen corresponding path program 9 times [2022-10-16 10:51:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:42,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424240366] [2022-10-16 10:51:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:42,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:42,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788369307] [2022-10-16 10:51:42,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:51:42,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:42,149 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:42,167 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:42,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 10:51:42,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:42,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:51:42,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 10:51:42,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 10:51:42,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424240366] [2022-10-16 10:51:42,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788369307] [2022-10-16 10:51:42,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788369307] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:42,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:42,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-10-16 10:51:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471631258] [2022-10-16 10:51:42,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:42,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 10:51:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 10:51:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:51:42,802 INFO L87 Difference]: Start difference. First operand 384 states and 444 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:43,256 INFO L93 Difference]: Finished difference Result 429 states and 492 transitions. [2022-10-16 10:51:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:51:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 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 66 [2022-10-16 10:51:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:43,259 INFO L225 Difference]: With dead ends: 429 [2022-10-16 10:51:43,259 INFO L226 Difference]: Without dead ends: 363 [2022-10-16 10:51:43,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 10:51:43,260 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 161 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:43,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 328 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-10-16 10:51:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-10-16 10:51:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 354 states have (on average 1.1864406779661016) internal successors, (420), 360 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:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 420 transitions. [2022-10-16 10:51:43,304 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 420 transitions. Word has length 66 [2022-10-16 10:51:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:43,305 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 420 transitions. [2022-10-16 10:51:43,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 420 transitions. [2022-10-16 10:51:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 10:51:43,306 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:43,306 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:43,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:43,520 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:51:43,520 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1153339649, now seen corresponding path program 10 times [2022-10-16 10:51:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:43,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098873567] [2022-10-16 10:51:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:44,928 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:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:44,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098873567] [2022-10-16 10:51:44,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098873567] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:44,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883232401] [2022-10-16 10:51:44,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:51:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:44,930 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:51:44,931 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:51:45,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:51:45,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:45,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 10:51:45,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:45,179 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:45,245 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:45,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:51:45,312 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:45,312 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:45,414 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:45,414 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:45,534 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:45,534 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:45,649 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:45,650 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:45,789 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:45,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:45,959 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:45,961 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:46,045 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:46,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883232401] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:46,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:46,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 38 [2022-10-16 10:51:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785547038] [2022-10-16 10:51:46,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:46,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:51:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:46,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:51:46,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:51:46,048 INFO L87 Difference]: Start difference. First operand 361 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:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:47,879 INFO L93 Difference]: Finished difference Result 517 states and 616 transitions. [2022-10-16 10:51:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:51:47,880 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:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:47,882 INFO L225 Difference]: With dead ends: 517 [2022-10-16 10:51:47,882 INFO L226 Difference]: Without dead ends: 404 [2022-10-16 10:51:47,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2022-10-16 10:51:47,885 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 128 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:47,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1039 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-10-16 10:51:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-10-16 10:51:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 375. [2022-10-16 10:51:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 368 states have (on average 1.184782608695652) internal successors, (436), 374 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:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 436 transitions. [2022-10-16 10:51:47,928 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 436 transitions. Word has length 69 [2022-10-16 10:51:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:47,929 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 436 transitions. [2022-10-16 10:51:47,929 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:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 436 transitions. [2022-10-16 10:51:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:51:47,930 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:47,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:47,967 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:51:48,143 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:51:48,145 INFO L420 AbstractCegarLoop]: === Iteration 40 === 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:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1763655328, now seen corresponding path program 10 times [2022-10-16 10:51:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:48,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539591385] [2022-10-16 10:51:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:48,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:48,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119064440] [2022-10-16 10:51:48,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:51:48,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:48,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:48,165 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:51:48,186 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:51:48,291 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:51:48,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:48,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:51:48,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:51:48,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:51:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:48,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539591385] [2022-10-16 10:51:48,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:48,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119064440] [2022-10-16 10:51:48,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119064440] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:48,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:48,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-10-16 10:51:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016140664] [2022-10-16 10:51:48,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:48,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 10:51:48,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:48,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 10:51:48,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:51:48,739 INFO L87 Difference]: Start difference. First operand 375 states and 436 transitions. Second operand has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:49,243 INFO L93 Difference]: Finished difference Result 434 states and 508 transitions. [2022-10-16 10:51:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 10:51:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 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:51:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:49,246 INFO L225 Difference]: With dead ends: 434 [2022-10-16 10:51:49,246 INFO L226 Difference]: Without dead ends: 349 [2022-10-16 10:51:49,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:51:49,248 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 220 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:49,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 267 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:51:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-10-16 10:51:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2022-10-16 10:51:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 334 states have (on average 1.188622754491018) internal successors, (397), 340 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have 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:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 397 transitions. [2022-10-16 10:51:49,280 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 397 transitions. Word has length 70 [2022-10-16 10:51:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:49,280 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 397 transitions. [2022-10-16 10:51:49,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 397 transitions. [2022-10-16 10:51:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:51:49,281 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:49,281 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:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-10-16 10:51:49,481 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:51:49,482 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:51:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1198011565, now seen corresponding path program 11 times [2022-10-16 10:51:49,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:49,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211421782] [2022-10-16 10:51:49,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:49,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:49,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:49,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874431195] [2022-10-16 10:51:49,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:51:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:49,502 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:51:49,524 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:51:49,704 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-10-16 10:51:49,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:49,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-16 10:51:49,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:49,713 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:49,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, 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:49,987 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:49,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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:51:50,070 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:50,161 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:50,226 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:51:50,241 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:50,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:50,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:50,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:50,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:50,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:50,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 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_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:50,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_262| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_262|)) (forall ((v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 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_262| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:50,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_262| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_262| (+ |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_262| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:52:08,100 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:52:08,100 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:52:08,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:08,108 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:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 4 times theorem prover too weak. 28 trivial. 42 not checked. [2022-10-16 10:52:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211421782] [2022-10-16 10:52:08,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:52:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874431195] [2022-10-16 10:52:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874431195] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:08,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:52:08,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2022-10-16 10:52:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072250468] [2022-10-16 10:52:08,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 10:52:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 10:52:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=556, Unknown=22, NotChecked=378, Total=1056 [2022-10-16 10:52:08,198 INFO L87 Difference]: Start difference. First operand 341 states and 397 transitions. Second operand has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:52:10,976 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|)) (= 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_262| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_262| (+ |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 (+ (* |v_ULTIMATE.start_main_~i~0#1_262| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |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:52:12,982 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_ULTIMATE.start_main_~i~0#1_262| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_262|)) (forall ((v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 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_262| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:52:13,720 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_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_262| Int) (v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_262| (+ |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 (+ (* |v_ULTIMATE.start_main_~i~0#1_262| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) is different from false [2022-10-16 10:52:15,724 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_ULTIMATE.start_main_~i~0#1_262| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_262|)) (forall ((v_ArrVal_1440 (Array Int Int)) (v_ArrVal_1438 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_262| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1438)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) is different from false [2022-10-16 10:52:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:19,522 INFO L93 Difference]: Finished difference Result 528 states and 622 transitions. [2022-10-16 10:52:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 10:52:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-10-16 10:52:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:19,525 INFO L225 Difference]: With dead ends: 528 [2022-10-16 10:52:19,525 INFO L226 Difference]: Without dead ends: 477 [2022-10-16 10:52:19,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 106 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=155, Invalid=915, Unknown=30, NotChecked=792, Total=1892 [2022-10-16 10:52:19,527 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 107 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:19,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 383 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 651 Invalid, 0 Unknown, 626 Unchecked, 0.4s Time] [2022-10-16 10:52:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-10-16 10:52:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 375. [2022-10-16 10:52:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 368 states have (on average 1.173913043478261) internal successors, (432), 374 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have 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:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 432 transitions. [2022-10-16 10:52:19,565 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 432 transitions. Word has length 70 [2022-10-16 10:52:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:19,566 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 432 transitions. [2022-10-16 10:52:19,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:52:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 432 transitions. [2022-10-16 10:52:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 10:52:19,567 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:19,567 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:19,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-10-16 10:52:19,780 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:19,780 INFO L420 AbstractCegarLoop]: === Iteration 42 === 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:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash 445652671, now seen corresponding path program 11 times [2022-10-16 10:52:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:19,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124891439] [2022-10-16 10:52:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:52:20,454 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:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:20,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124891439] [2022-10-16 10:52:20,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124891439] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:52:20,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354093665] [2022-10-16 10:52:20,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:52:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:20,459 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:20,475 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:20,640 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:52:20,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:20,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:52:20,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:21,290 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:21,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:21,978 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:21,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354093665] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:21,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:52:21,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2022-10-16 10:52:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444974613] [2022-10-16 10:52:21,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:21,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:52:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:52:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:52:21,982 INFO L87 Difference]: Start difference. First operand 375 states and 432 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:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:23,866 INFO L93 Difference]: Finished difference Result 574 states and 658 transitions. [2022-10-16 10:52:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-10-16 10:52:23,867 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:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:23,870 INFO L225 Difference]: With dead ends: 574 [2022-10-16 10:52:23,870 INFO L226 Difference]: Without dead ends: 491 [2022-10-16 10:52:23,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 110 SyntacticMatches, 25 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3154 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1265, Invalid=7107, Unknown=0, NotChecked=0, Total=8372 [2022-10-16 10:52:23,872 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 451 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:23,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 387 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 10:52:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-10-16 10:52:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 419. [2022-10-16 10:52:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 412 states have (on average 1.1601941747572815) internal successors, (478), 418 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have 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,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 478 transitions. [2022-10-16 10:52:23,916 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 478 transitions. Word has length 76 [2022-10-16 10:52:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:23,916 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 478 transitions. [2022-10-16 10:52:23,916 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:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 478 transitions. [2022-10-16 10:52:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:52:23,918 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:23,918 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:23,959 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:52:24,132 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:52:24,132 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:52:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash 952699344, now seen corresponding path program 12 times [2022-10-16 10:52:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052822686] [2022-10-16 10:52:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:24,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:52:24,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083932420] [2022-10-16 10:52:24,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:52:24,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:24,154 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:52:24,176 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:52:24,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:52:24,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:24,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 10:52:24,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:24,331 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:24,544 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:24,810 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:52:24,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:52:25,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:52:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 58 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:52:25,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:26,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_286| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_286| 3) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2022-10-16 10:52:26,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_286| 1)) (< |v_ULTIMATE.start_main_~i~0#1_286| 3) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2022-10-16 10:52:26,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_286| 3) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_286|))) is different from false [2022-10-16 10:52:26,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_286| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_286|) (< |v_ULTIMATE.start_main_~i~0#1_286| 3) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_286| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2022-10-16 10:52:26,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:26,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-10-16 10:52:26,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:26,381 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:52:26,387 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:52:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 28 trivial. 13 not checked. [2022-10-16 10:52:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:26,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052822686] [2022-10-16 10:52:26,866 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:52:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083932420] [2022-10-16 10:52:26,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083932420] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:26,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:52:26,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2022-10-16 10:52:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556676999] [2022-10-16 10:52:26,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:26,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-10-16 10:52:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-10-16 10:52:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1603, Unknown=14, NotChecked=340, Total=2162 [2022-10-16 10:52:26,869 INFO L87 Difference]: Start difference. First operand 419 states and 478 transitions. Second operand has 47 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 47 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:28,671 INFO L93 Difference]: Finished difference Result 530 states and 611 transitions. [2022-10-16 10:52:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:52:28,672 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 47 states have internal predecessors, (119), 0 states have call successors, (0), 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:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:28,673 INFO L225 Difference]: With dead ends: 530 [2022-10-16 10:52:28,674 INFO L226 Difference]: Without dead ends: 497 [2022-10-16 10:52:28,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=534, Invalid=3628, Unknown=14, NotChecked=516, Total=4692 [2022-10-16 10:52:28,675 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:28,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 319 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 290 Unchecked, 0.1s Time] [2022-10-16 10:52:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-10-16 10:52:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 496. [2022-10-16 10:52:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 489 states have (on average 1.1533742331288344) internal successors, (564), 495 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 564 transitions. [2022-10-16 10:52:28,730 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 564 transitions. Word has length 77 [2022-10-16 10:52:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:28,731 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 564 transitions. [2022-10-16 10:52:28,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 47 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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,731 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 564 transitions. [2022-10-16 10:52:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:52:28,732 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:28,732 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:28,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-10-16 10:52:28,947 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:52:28,947 INFO L420 AbstractCegarLoop]: === Iteration 44 === 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:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash 952699152, now seen corresponding path program 2 times [2022-10-16 10:52:28,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:28,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135611378] [2022-10-16 10:52:28,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:28,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:52:29,768 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:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:29,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135611378] [2022-10-16 10:52:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135611378] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:52:29,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782182452] [2022-10-16 10:52:29,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:52:29,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:29,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:29,771 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:52:29,795 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:52:29,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:52:29,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:29,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:52:29,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:29,933 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:29,937 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:29,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, 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:29,971 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:29,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:30,003 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:30,031 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:30,058 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:30,088 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:30,114 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:30,256 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:30,497 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:52:30,497 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 66 treesize of output 44 [2022-10-16 10:52:30,790 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-10-16 10:52:30,791 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 87 treesize of output 60 [2022-10-16 10:52:31,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:31,074 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 97 treesize of output 97 [2022-10-16 10:52:31,166 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:31,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:58,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1639 Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_308| Int) (v_ArrVal_1641 Int) (v_ArrVal_1643 Int) (|v_ULTIMATE.start_main_~i~0#1_304| Int) (|v_ULTIMATE.start_main_~i~0#1_306| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1637))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1643)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_304| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_306| 4)))) (.cse3 (select v_ArrVal_1637 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1639)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_308| 4))))) (or (< (+ v_ArrVal_1641 .cse0) v_ArrVal_1643) (< 4 .cse1) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3) v_ArrVal_1639) (< (+ .cse1 v_ArrVal_1643) 9223372036854775808) (< 4 .cse0) (< 4 .cse3) (< (+ .cse4 v_ArrVal_1639) v_ArrVal_1641) (< 4 .cse4)))))) is different from false [2022-10-16 10:53:03,341 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,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782182452] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:03,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:03,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-10-16 10:53:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010821124] [2022-10-16 10:53:03,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:03,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:53:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:03,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:53:03,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1173, Unknown=13, NotChecked=74, Total=1560 [2022-10-16 10:53:03,343 INFO L87 Difference]: Start difference. First operand 496 states and 564 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:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:12,270 INFO L93 Difference]: Finished difference Result 599 states and 703 transitions. [2022-10-16 10:53:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:53:12,270 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:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:12,272 INFO L225 Difference]: With dead ends: 599 [2022-10-16 10:53:12,272 INFO L226 Difference]: Without dead ends: 598 [2022-10-16 10:53:12,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=632, Invalid=2437, Unknown=15, NotChecked=108, Total=3192 [2022-10-16 10:53:12,273 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 92 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:12,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 429 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 270 Unchecked, 0.1s Time] [2022-10-16 10:53:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-10-16 10:53:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 588. [2022-10-16 10:53:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 581 states have (on average 1.1652323580034423) internal successors, (677), 587 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 677 transitions. [2022-10-16 10:53:12,334 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 677 transitions. Word has length 77 [2022-10-16 10:53:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:12,334 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 677 transitions. [2022-10-16 10:53:12,334 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:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 677 transitions. [2022-10-16 10:53:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 10:53:12,335 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:12,336 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:12,372 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:12,549 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:12,549 INFO L420 AbstractCegarLoop]: === Iteration 45 === 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:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash 744540091, now seen corresponding path program 12 times [2022-10-16 10:53:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:12,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322177494] [2022-10-16 10:53:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:14,375 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:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:14,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322177494] [2022-10-16 10:53:14,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322177494] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:14,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705622014] [2022-10-16 10:53:14,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:53:14,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:14,385 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:14,402 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:14,874 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-16 10:53:14,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:14,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjunts are in the unsatisfiable core [2022-10-16 10:53:14,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:14,958 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:15,033 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:15,034 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:15,117 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:15,118 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:15,258 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:15,258 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:15,396 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:15,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, 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:15,537 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:15,538 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:15,682 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:15,682 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:15,854 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,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:16,072 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:16,075 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:16,170 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,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705622014] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:16,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:16,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 44 [2022-10-16 10:53:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864496809] [2022-10-16 10:53:16,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:16,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:53:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:16,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:53:16,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2022-10-16 10:53:16,172 INFO L87 Difference]: Start difference. First operand 588 states and 677 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:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:18,733 INFO L93 Difference]: Finished difference Result 747 states and 876 transitions. [2022-10-16 10:53:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:53:18,733 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:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:18,736 INFO L225 Difference]: With dead ends: 747 [2022-10-16 10:53:18,736 INFO L226 Difference]: Without dead ends: 634 [2022-10-16 10:53:18,737 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:18,738 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:18,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1232 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-10-16 10:53:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-10-16 10:53:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 602. [2022-10-16 10:53:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 595 states have (on average 1.1647058823529413) internal successors, (693), 601 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have 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:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 693 transitions. [2022-10-16 10:53:18,810 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 693 transitions. Word has length 80 [2022-10-16 10:53:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:18,810 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 693 transitions. [2022-10-16 10:53:18,810 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:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 693 transitions. [2022-10-16 10:53:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 10:53:18,812 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:18,812 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:18,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-10-16 10:53:19,025 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:19,025 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2011806143, now seen corresponding path program 2 times [2022-10-16 10:53:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:19,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717992771] [2022-10-16 10:53:19,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:19,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 10:53:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717992771] [2022-10-16 10:53:19,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717992771] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043977472] [2022-10-16 10:53:19,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:53:19,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:19,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:19,253 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:19,278 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:19,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:53:19,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:19,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:53:19,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-10-16 10:53:19,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-10-16 10:53:19,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043977472] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:19,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:19,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:53:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544518287] [2022-10-16 10:53:19,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:19,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:53:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:19,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:53:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:53:19,629 INFO L87 Difference]: Start difference. First operand 602 states and 693 transitions. Second operand has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 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:53:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:20,095 INFO L93 Difference]: Finished difference Result 648 states and 735 transitions. [2022-10-16 10:53:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:53:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 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 87 [2022-10-16 10:53:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:20,099 INFO L225 Difference]: With dead ends: 648 [2022-10-16 10:53:20,099 INFO L226 Difference]: Without dead ends: 647 [2022-10-16 10:53:20,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 170 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:53:20,101 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 146 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:20,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 185 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:53:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-10-16 10:53:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 557. [2022-10-16 10:53:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 551 states have (on average 1.1197822141560798) internal successors, (617), 556 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have 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:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 617 transitions. [2022-10-16 10:53:20,219 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 617 transitions. Word has length 87 [2022-10-16 10:53:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:20,219 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 617 transitions. [2022-10-16 10:53:20,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 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:53:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 617 transitions. [2022-10-16 10:53:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 10:53:20,221 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:20,221 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:20,283 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:20,435 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:20,436 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:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1453671805, now seen corresponding path program 13 times [2022-10-16 10:53:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:20,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009002262] [2022-10-16 10:53:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:21,492 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:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009002262] [2022-10-16 10:53:21,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009002262] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272546163] [2022-10-16 10:53:21,492 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:53:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:21,494 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:21,510 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:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:21,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:53:21,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:22,551 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:22,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:23,645 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:23,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272546163] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:23,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:23,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2022-10-16 10:53:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655897903] [2022-10-16 10:53:23,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:23,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-16 10:53:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-16 10:53:23,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2022-10-16 10:53:23,648 INFO L87 Difference]: Start difference. First operand 557 states and 617 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:53:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:27,444 INFO L93 Difference]: Finished difference Result 827 states and 909 transitions. [2022-10-16 10:53:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-10-16 10:53:27,444 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:53:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:27,448 INFO L225 Difference]: With dead ends: 827 [2022-10-16 10:53:27,448 INFO L226 Difference]: Without dead ends: 739 [2022-10-16 10:53:27,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5190 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2093, Invalid=11949, Unknown=0, NotChecked=0, Total=14042 [2022-10-16 10:53:27,451 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 519 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:27,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 484 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 10:53:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-10-16 10:53:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 601. [2022-10-16 10:53:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 595 states have (on average 1.1159663865546219) internal successors, (664), 600 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have 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:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 664 transitions. [2022-10-16 10:53:27,536 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 664 transitions. Word has length 87 [2022-10-16 10:53:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:27,537 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 664 transitions. [2022-10-16 10:53:27,537 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:53:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 664 transitions. [2022-10-16 10:53:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-16 10:53:27,538 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:27,538 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:53:27,584 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:53:27,752 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:53:27,752 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:53:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1339241884, now seen corresponding path program 13 times [2022-10-16 10:53:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:27,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118118013] [2022-10-16 10:53:27,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:27,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:53:27,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846438000] [2022-10-16 10:53:27,775 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:53:27,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:27,776 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:53:27,794 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:53:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:27,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-16 10:53:27,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:27,935 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:28,147 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:28,270 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:28,271 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:53:28,369 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:28,460 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:28,558 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:28,647 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:53:28,663 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:53:28,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:28,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:28,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:53:28,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:53:28,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:53:28,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:53:28,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:53:28,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 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_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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:53:28,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 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_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |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_372|)))) is different from false [2022-10-16 10:53:28,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 Int) (|v_ULTIMATE.start_main_~i~0#1_372| 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_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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_372| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:53:30,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 Int) (|v_ULTIMATE.start_main_~i~0#1_372| 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|) (+ (* |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_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_372| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:53:31,021 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:53:31,022 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:53:31,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:53:31,028 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:31,152 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:53:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:31,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118118013] [2022-10-16 10:53:31,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:53:31,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846438000] [2022-10-16 10:53:31,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846438000] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:31,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:53:31,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 39 [2022-10-16 10:53:31,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329401893] [2022-10-16 10:53:31,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:31,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-16 10:53:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:31,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-16 10:53:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=725, Unknown=10, NotChecked=630, Total=1482 [2022-10-16 10:53:31,155 INFO L87 Difference]: Start difference. First operand 601 states and 664 transitions. Second operand has 39 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 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:53:32,176 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|)) (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 Int) (|v_ULTIMATE.start_main_~i~0#1_372| 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_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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_372| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (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|))) is different from false [2022-10-16 10:53:34,182 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 (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 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_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |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_372|)))) (= (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|)))) is different from false [2022-10-16 10:53:35,101 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_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 Int) (|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (= 4 (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)) (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_372| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:53:35,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4)) (= (select .cse1 .cse0) 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 Int) (|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (< |v_ULTIMATE.start_main_~i~0#1_372| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2022-10-16 10:53:37,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_372| Int)) (or (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 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_372| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1929)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4)) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_372|)))) (= (select .cse1 .cse0) 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2022-10-16 10:53:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:38,520 INFO L93 Difference]: Finished difference Result 775 states and 863 transitions. [2022-10-16 10:53:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-16 10:53:38,521 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 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 88 [2022-10-16 10:53:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:38,523 INFO L225 Difference]: With dead ends: 775 [2022-10-16 10:53:38,524 INFO L226 Difference]: Without dead ends: 751 [2022-10-16 10:53:38,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 137 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=196, Invalid=1331, Unknown=15, NotChecked=1320, Total=2862 [2022-10-16 10:53:38,526 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 148 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 931 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:38,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 572 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1022 Invalid, 0 Unknown, 931 Unchecked, 0.6s Time] [2022-10-16 10:53:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-10-16 10:53:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 656. [2022-10-16 10:53:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 650 states have (on average 1.1123076923076922) internal successors, (723), 655 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have 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:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 723 transitions. [2022-10-16 10:53:38,601 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 723 transitions. Word has length 88 [2022-10-16 10:53:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:38,602 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 723 transitions. [2022-10-16 10:53:38,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 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:53:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 723 transitions. [2022-10-16 10:53:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 10:53:38,604 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:38,604 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:53:38,640 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:53:38,817 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:53:38,817 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:53:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -71896873, now seen corresponding path program 2 times [2022-10-16 10:53:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589392742] [2022-10-16 10:53:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-16 10:53:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:39,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589392742] [2022-10-16 10:53:39,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589392742] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:39,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991675858] [2022-10-16 10:53:39,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:53:39,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:39,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:39,218 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:53:39,219 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:53:39,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:53:39,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:39,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 10:53:39,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-10-16 10:53:39,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:53:39,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991675858] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:53:39,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:53:39,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [21] total 24 [2022-10-16 10:53:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777827820] [2022-10-16 10:53:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:53:39,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:53:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:53:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:53:39,789 INFO L87 Difference]: Start difference. First operand 656 states and 723 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:53:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:39,961 INFO L93 Difference]: Finished difference Result 656 states and 723 transitions. [2022-10-16 10:53:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:53:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-10-16 10:53:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:39,965 INFO L225 Difference]: With dead ends: 656 [2022-10-16 10:53:39,966 INFO L226 Difference]: Without dead ends: 653 [2022-10-16 10:53:39,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-10-16 10:53:39,967 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:39,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 31 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:53:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-10-16 10:53:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 427. [2022-10-16 10:53:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 422 states have (on average 1.080568720379147) internal successors, (456), 426 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 456 transitions. [2022-10-16 10:53:40,048 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 456 transitions. Word has length 90 [2022-10-16 10:53:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:40,048 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 456 transitions. [2022-10-16 10:53:40,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:53:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 456 transitions. [2022-10-16 10:53:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 10:53:40,049 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:40,050 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:53:40,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-10-16 10:53:40,263 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:53:40,263 INFO L420 AbstractCegarLoop]: === Iteration 50 === 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:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2096094215, now seen corresponding path program 14 times [2022-10-16 10:53:40,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:40,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263121949] [2022-10-16 10:53:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:53:42,498 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:53:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:42,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263121949] [2022-10-16 10:53:42,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263121949] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:53:42,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760635110] [2022-10-16 10:53:42,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:53:42,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:42,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:42,500 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:53:42,521 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:53:42,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:53:42,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:42,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 83 conjunts are in the unsatisfiable core [2022-10-16 10:53:42,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:42,761 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:42,843 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:42,844 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:42,936 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:42,936 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:43,078 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:43,079 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:43,220 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:43,221 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:43,367 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:43,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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:43,520 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:43,520 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:43,674 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:43,675 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:43,875 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:53:43,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:44,117 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:44,119 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:44,225 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:53:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760635110] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:44,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:53:44,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 50 [2022-10-16 10:53:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595661272] [2022-10-16 10:53:44,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-16 10:53:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-16 10:53:44,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2310, Unknown=0, NotChecked=0, Total=2450 [2022-10-16 10:53:44,228 INFO L87 Difference]: Start difference. First operand 427 states and 456 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:53:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:53:47,497 INFO L93 Difference]: Finished difference Result 499 states and 534 transitions. [2022-10-16 10:53:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:53:47,498 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:53:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:53:47,500 INFO L225 Difference]: With dead ends: 499 [2022-10-16 10:53:47,501 INFO L226 Difference]: Without dead ends: 464 [2022-10-16 10:53:47,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=272, Invalid=4840, Unknown=0, NotChecked=0, Total=5112 [2022-10-16 10:53:47,504 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 168 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 4012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:53:47,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1380 Invalid, 4012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-10-16 10:53:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-10-16 10:53:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 434. [2022-10-16 10:53:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.0815850815850816) internal successors, (464), 433 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 464 transitions. [2022-10-16 10:53:47,581 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 464 transitions. Word has length 91 [2022-10-16 10:53:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:53:47,582 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 464 transitions. [2022-10-16 10:53:47,583 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:53:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 464 transitions. [2022-10-16 10:53:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 10:53:47,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:53:47,584 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:53:47,625 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:53:47,800 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:53:47,800 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:53:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:53:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -852804955, now seen corresponding path program 14 times [2022-10-16 10:53:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:53:47,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693649759] [2022-10-16 10:53:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:53:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:53:47,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:53:47,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620404568] [2022-10-16 10:53:47,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:53:47,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:53:47,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:53:47,821 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:53:47,825 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:53:47,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:53:47,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:53:47,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:53:47,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:53:47,995 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:48,185 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:48,299 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:48,300 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:53:48,403 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:48,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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:53:48,512 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:53:48,512 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:53:48,610 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:48,713 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:48,832 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:53:48,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:53:48,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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:48,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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:53:48,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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:53:48,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2178 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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:53:49,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (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_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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:53:49,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404|)))) is different from false [2022-10-16 10:53:49,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |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_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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:53:49,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| 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_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:53:49,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_405|)) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| 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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))))) is different from false [2022-10-16 10:53:49,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |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 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))) is different from false [2022-10-16 10:53:49,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |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|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))) is different from false [2022-10-16 10:53:49,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_406| Int)) (or (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| 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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_406|)))) is different from false [2022-10-16 10:53:49,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| 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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) is different from false [2022-10-16 10:53:49,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= 4 (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)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) is different from false [2022-10-16 10:53:49,739 INFO L356 Elim1Store]: treesize reduction 203, result has 20.1 percent of original size [2022-10-16 10:53:49,740 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:53:49,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:53:49,749 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:49,849 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:53:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:53:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693649759] [2022-10-16 10:53:49,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:53:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620404568] [2022-10-16 10:53:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620404568] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:53:49,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:53:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 44 [2022-10-16 10:53:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861280386] [2022-10-16 10:53:49,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:53:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:53:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:53:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:53:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=773, Unknown=14, NotChecked=966, Total=1892 [2022-10-16 10:53:49,852 INFO L87 Difference]: Start difference. First operand 434 states and 464 transitions. Second operand has 44 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 44 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:53:51,096 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|)) (= 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_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))))) is different from false [2022-10-16 10:53:53,103 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_ULTIMATE.start_main_~i~0#1_406| Int)) (or (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_406|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:53:55,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.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_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 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|)) (= (select .cse0 .cse1) 4) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= 4 (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)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| .cse3) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse2 v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))))) is different from false [2022-10-16 10:53:57,198 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_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| .cse0) (= (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_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))) (<= 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|)) (= (select .cse1 .cse2) 4) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))))) is different from false [2022-10-16 10:53:59,207 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|) (forall ((|v_ULTIMATE.start_main_~i~0#1_406| Int)) (or (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_406|)))) (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_405| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_405|)) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (= (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_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))))))) is different from false [2022-10-16 10:54:01,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.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 (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| .cse3))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse2) 4) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= 4 (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)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| .cse3) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:03,392 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_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| .cse0) (= (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_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))) (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_404| .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_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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|)) (= (select .cse1 .cse2) 4) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:05,418 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 (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int 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_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_404|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_406| Int)) (or (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_406|)))) (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_405| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_405|)) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (= (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_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))))))) is different from false [2022-10-16 10:54:07,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.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 (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| .cse3))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse2) 4) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= 4 (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)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| .cse3) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))))) is different from false [2022-10-16 10:54:09,685 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_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_405| .cse0) (= (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_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))) (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_404| .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_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |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|)) (= (select .cse1 .cse2) 4) (forall ((v_ArrVal_2178 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_406| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_406| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:54:11,706 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 (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (forall ((v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int 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_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_404|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_406| Int)) (or (forall ((v_ArrVal_2173 Int) (v_ArrVal_2172 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int) (|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_406| 4)) v_ArrVal_2172) (+ (* |v_ULTIMATE.start_main_~i~0#1_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)) (< |v_ULTIMATE.start_main_~i~0#1_405| (+ |v_ULTIMATE.start_main_~i~0#1_406| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_406|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 .cse1) 4) (forall ((v_ArrVal_2178 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~i~0#1_405| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_405|)) (forall ((v_ArrVal_2173 Int) (v_ArrVal_2175 Int) (v_ArrVal_2178 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_404| Int)) (or (= (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_405| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2173) (+ (* |v_ULTIMATE.start_main_~i~0#1_404| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (< |v_ULTIMATE.start_main_~i~0#1_404| (+ |v_ULTIMATE.start_main_~i~0#1_405| 1)))))))) is different from false [2022-10-16 10:54:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:11,960 INFO L93 Difference]: Finished difference Result 465 states and 495 transitions. [2022-10-16 10:54:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:54:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 44 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 92 [2022-10-16 10:54:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:11,963 INFO L225 Difference]: With dead ends: 465 [2022-10-16 10:54:11,963 INFO L226 Difference]: Without dead ends: 453 [2022-10-16 10:54:11,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 142 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=209, Invalid=1126, Unknown=25, NotChecked=2300, Total=3660 [2022-10-16 10:54:11,964 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 122 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1189 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:11,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 436 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 884 Invalid, 0 Unknown, 1189 Unchecked, 0.6s Time] [2022-10-16 10:54:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-10-16 10:54:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2022-10-16 10:54:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.0825242718446602) internal successors, (446), 416 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 446 transitions. [2022-10-16 10:54:12,029 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 446 transitions. Word has length 92 [2022-10-16 10:54:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:12,029 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 446 transitions. [2022-10-16 10:54:12,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 44 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:54:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 446 transitions. [2022-10-16 10:54:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 10:54:12,031 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:12,031 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:12,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-10-16 10:54:12,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:12,244 INFO L420 AbstractCegarLoop]: === Iteration 52 === 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:12,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash -315167231, now seen corresponding path program 15 times [2022-10-16 10:54:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:12,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58297731] [2022-10-16 10:54:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:12,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:54:12,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726623110] [2022-10-16 10:54:12,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:54:12,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:12,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:12,268 INFO L229 MonitoredProcess]: Starting monitored process 46 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:12,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-10-16 10:54:12,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:54:12,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:54:12,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-16 10:54:12,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:12,659 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:13,112 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:13,582 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:54:13,845 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:54:14,154 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:54:14,425 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:54:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 62 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 10:54:14,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:17,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:54:17,510 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:54:17,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:54:17,531 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:54:17,544 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:54:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 33 proven. 91 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 10:54:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58297731] [2022-10-16 10:54:18,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:54:18,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726623110] [2022-10-16 10:54:18,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726623110] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:18,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:54:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2022-10-16 10:54:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70494301] [2022-10-16 10:54:18,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:18,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-16 10:54:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-16 10:54:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=3142, Unknown=9, NotChecked=0, Total=3540 [2022-10-16 10:54:18,884 INFO L87 Difference]: Start difference. First operand 417 states and 446 transitions. Second operand has 60 states, 60 states have (on average 2.3833333333333333) internal successors, (143), 60 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:54:20,460 INFO L93 Difference]: Finished difference Result 545 states and 578 transitions. [2022-10-16 10:54:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:54:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.3833333333333333) internal successors, (143), 60 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-10-16 10:54:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:54:20,462 INFO L225 Difference]: With dead ends: 545 [2022-10-16 10:54:20,462 INFO L226 Difference]: Without dead ends: 533 [2022-10-16 10:54:20,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=743, Invalid=5100, Unknown=9, NotChecked=0, Total=5852 [2022-10-16 10:54:20,464 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 134 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:54:20,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 442 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 251 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2022-10-16 10:54:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-16 10:54:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 417. [2022-10-16 10:54:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.0825242718446602) internal successors, (446), 416 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 446 transitions. [2022-10-16 10:54:20,529 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 446 transitions. Word has length 95 [2022-10-16 10:54:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:54:20,529 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 446 transitions. [2022-10-16 10:54:20,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.3833333333333333) internal successors, (143), 60 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:54:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 446 transitions. [2022-10-16 10:54:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-16 10:54:20,531 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:54:20,531 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:54:20,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-10-16 10:54:20,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-10-16 10:54:20,744 INFO L420 AbstractCegarLoop]: === Iteration 53 === 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:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:54:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash -666470217, now seen corresponding path program 15 times [2022-10-16 10:54:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:54:20,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037936534] [2022-10-16 10:54:20,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:54:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:54:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:54:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 162 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:54:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037936534] [2022-10-16 10:54:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037936534] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:54:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931422559] [2022-10-16 10:54:22,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:54:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:54:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:54:22,855 INFO L229 MonitoredProcess]: Starting monitored process 47 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:22,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-10-16 10:54:23,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-10-16 10:54:23,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:54:23,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-16 10:54:23,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:54:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 212 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:24,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:54:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 212 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:54:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931422559] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:54:27,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:54:27,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 58 [2022-10-16 10:54:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656740364] [2022-10-16 10:54:27,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:54:27,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-10-16 10:54:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:54:27,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-10-16 10:54:27,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=2870, Unknown=0, NotChecked=0, Total=3306 [2022-10-16 10:54:27,406 INFO L87 Difference]: Start difference. First operand 417 states and 446 transitions. Second operand has 58 states, 58 states have (on average 2.913793103448276) internal successors, (169), 58 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)