/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/sina3f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:57:10,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:57:10,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:57:10,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:57:10,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:57:10,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:57:10,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:57:10,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:57:10,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:57:10,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:57:10,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:57:10,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:57:10,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:57:10,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:57:10,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:57:10,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:57:10,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:57:10,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:57:10,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:57:10,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:57:10,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:57:10,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:57:10,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:57:10,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:57:10,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:57:10,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:57:10,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:57:10,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:57:10,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:57:10,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:57:10,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:57:10,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:57:10,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:57:10,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:57:10,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:57:10,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:57:10,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:57:10,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:57:10,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:57:10,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:57:10,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:57:10,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 10:57:10,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:57:10,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:57:10,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:57:10,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:57:10,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:57:10,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:57:10,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:57:10,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:57:10,560 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:57:10,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:57:10,561 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:57:10,562 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:57:10,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:57:10,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:57:10,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:57:10,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:57:10,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:57:10,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:57:10,563 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:57:10,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:57:10,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:57:10,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:57:10,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:57:10,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:57:10,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:57:10,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:57:10,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:57:10,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:57:10,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:57:10,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:57:10,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:57:10,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:57:10,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:57:10,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 10:57:10,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:57:11,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:57:11,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:57:11,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:57:11,033 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:57:11,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina3f.c [2022-10-16 10:57:11,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9a4aec3/38ed846dcb7b4a6a8f064509404450af/FLAG27e97f133 [2022-10-16 10:57:11,738 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:57:11,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3f.c [2022-10-16 10:57:11,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9a4aec3/38ed846dcb7b4a6a8f064509404450af/FLAG27e97f133 [2022-10-16 10:57:12,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9a4aec3/38ed846dcb7b4a6a8f064509404450af [2022-10-16 10:57:12,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:57:12,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:57:12,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:57:12,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:57:12,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:57:12,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fd8518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12, skipping insertion in model container [2022-10-16 10:57:12,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:57:12,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:57:12,321 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/sina3f.c[589,602] [2022-10-16 10:57:12,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:57:12,354 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:57:12,366 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/sina3f.c[589,602] [2022-10-16 10:57:12,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:57:12,396 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:57:12,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12 WrapperNode [2022-10-16 10:57:12,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:57:12,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:57:12,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:57:12,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:57:12,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,441 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-10-16 10:57:12,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:57:12,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:57:12,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:57:12,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:57:12,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,472 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:57:12,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:57:12,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:57:12,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:57:12,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (1/1) ... [2022-10-16 10:57:12,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:57:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:12,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 10:57:12,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 10:57:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:57:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:57:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:57:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:57:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:57:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:57:12,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:57:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:57:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:57:12,668 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:57:12,670 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:57:12,977 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:57:12,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:57:12,987 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-16 10:57:12,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:57:12 BoogieIcfgContainer [2022-10-16 10:57:12,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:57:12,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:57:12,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:57:13,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:57:13,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:57:12" (1/3) ... [2022-10-16 10:57:13,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2828a521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:57:13, skipping insertion in model container [2022-10-16 10:57:13,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:57:12" (2/3) ... [2022-10-16 10:57:13,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2828a521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:57:13, skipping insertion in model container [2022-10-16 10:57:13,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:57:12" (3/3) ... [2022-10-16 10:57:13,008 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3f.c [2022-10-16 10:57:13,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:57:13,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:57:13,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:57:13,218 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;@581c4d92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:57:13,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:57:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:57:13,231 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:13,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:13,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:57:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:13,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698633692] [2022-10-16 10:57:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:13,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698633692] [2022-10-16 10:57:13,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698633692] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:13,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:13,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:57:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027476303] [2022-10-16 10:57:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:57:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:13,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:57:13,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:57:13,488 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:13,513 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-10-16 10:57:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:57:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 10:57:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:13,526 INFO L225 Difference]: With dead ends: 112 [2022-10-16 10:57:13,526 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 10:57:13,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:57:13,534 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:13,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 10:57:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-16 10:57:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-10-16 10:57:13,579 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 8 [2022-10-16 10:57:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:13,580 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-10-16 10:57:13,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-10-16 10:57:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:57:13,581 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:13,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:13,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:57:13,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:57:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:13,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210355600] [2022-10-16 10:57:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:13,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:13,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210355600] [2022-10-16 10:57:13,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210355600] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:13,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:13,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373762641] [2022-10-16 10:57:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:13,851 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:13,957 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-10-16 10:57:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 10:57:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:13,960 INFO L225 Difference]: With dead ends: 101 [2022-10-16 10:57:13,960 INFO L226 Difference]: Without dead ends: 99 [2022-10-16 10:57:13,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:57:13,963 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:13,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 108 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-10-16 10:57:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2022-10-16 10:57:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-10-16 10:57:13,975 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 8 [2022-10-16 10:57:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:13,976 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-10-16 10:57:13,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-10-16 10:57:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:57:13,977 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:13,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:13,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:57:13,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash 678258679, now seen corresponding path program 1 times [2022-10-16 10:57:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825875230] [2022-10-16 10:57:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825875230] [2022-10-16 10:57:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825875230] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:14,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:14,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:57:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174835778] [2022-10-16 10:57:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:14,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:14,110 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:14,194 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-10-16 10:57:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 10:57:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:14,197 INFO L225 Difference]: With dead ends: 135 [2022-10-16 10:57:14,197 INFO L226 Difference]: Without dead ends: 93 [2022-10-16 10:57:14,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:14,202 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 62 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-16 10:57:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 59. [2022-10-16 10:57:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-10-16 10:57:14,225 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 10 [2022-10-16 10:57:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:14,225 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-10-16 10:57:14,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-10-16 10:57:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:57:14,231 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:14,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:14,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:57:14,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:57:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:14,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516696707] [2022-10-16 10:57:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516696707] [2022-10-16 10:57:14,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516696707] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:14,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572409570] [2022-10-16 10:57:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:14,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:14,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 10:57:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:14,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:14,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572409570] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:14,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:14,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:57:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325838340] [2022-10-16 10:57:14,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:14,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:57:14,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:14,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:57:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:57:14,607 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:14,785 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-10-16 10:57:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:14,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 10:57:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:14,788 INFO L225 Difference]: With dead ends: 112 [2022-10-16 10:57:14,788 INFO L226 Difference]: Without dead ends: 111 [2022-10-16 10:57:14,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:57:14,791 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:14,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-10-16 10:57:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2022-10-16 10:57:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-10-16 10:57:14,802 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 12 [2022-10-16 10:57:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:14,803 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-10-16 10:57:14,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-10-16 10:57:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:57:14,804 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:14,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:14,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:15,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:15,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:57:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:15,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326929469] [2022-10-16 10:57:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:15,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326929469] [2022-10-16 10:57:15,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326929469] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:15,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686253548] [2022-10-16 10:57:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:15,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:15,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:15,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 10:57:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:15,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:15,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:15,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:15,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686253548] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:15,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:15,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:15,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711377435] [2022-10-16 10:57:15,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:15,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:15,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:15,286 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:15,368 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-10-16 10:57:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 10:57:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:15,370 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:57:15,370 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:57:15,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:57:15,372 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:15,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 172 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:57:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2022-10-16 10:57:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-10-16 10:57:15,382 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 13 [2022-10-16 10:57:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:15,382 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-10-16 10:57:15,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-10-16 10:57:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:57:15,383 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:15,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:15,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:15,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:15,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash -825622541, now seen corresponding path program 1 times [2022-10-16 10:57:15,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:15,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363006677] [2022-10-16 10:57:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:15,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:15,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363006677] [2022-10-16 10:57:15,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363006677] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:15,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:15,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19638399] [2022-10-16 10:57:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:15,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:15,656 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:15,714 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-10-16 10:57:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:15,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 10:57:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:15,716 INFO L225 Difference]: With dead ends: 103 [2022-10-16 10:57:15,716 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 10:57:15,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:57:15,718 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:15,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 110 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 10:57:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2022-10-16 10:57:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-10-16 10:57:15,726 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 14 [2022-10-16 10:57:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:15,727 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-10-16 10:57:15,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-10-16 10:57:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 10:57:15,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:15,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:15,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 10:57:15,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1496738415, now seen corresponding path program 1 times [2022-10-16 10:57:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:15,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708531338] [2022-10-16 10:57:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:15,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708531338] [2022-10-16 10:57:15,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708531338] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:15,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617109844] [2022-10-16 10:57:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:15,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:15,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:15,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:15,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 10:57:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:15,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:15,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:15,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:16,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617109844] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:16,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:16,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:57:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045624566] [2022-10-16 10:57:16,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:16,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:57:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:16,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:57:16,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:57:16,030 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:16,367 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-10-16 10:57:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:57:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 10:57:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:16,369 INFO L225 Difference]: With dead ends: 218 [2022-10-16 10:57:16,369 INFO L226 Difference]: Without dead ends: 176 [2022-10-16 10:57:16,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:57:16,371 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 169 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:16,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 357 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-10-16 10:57:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2022-10-16 10:57:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 105 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-10-16 10:57:16,383 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 18 [2022-10-16 10:57:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:16,383 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-10-16 10:57:16,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-10-16 10:57:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 10:57:16,385 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:16,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:16,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:16,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:16,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -845800761, now seen corresponding path program 1 times [2022-10-16 10:57:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:16,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691322514] [2022-10-16 10:57:16,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691322514] [2022-10-16 10:57:17,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691322514] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783069193] [2022-10-16 10:57:17,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:17,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:17,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:17,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:17,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 10:57:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:17,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2022-10-16 10:57:17,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:17,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:17,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:17,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:57:17,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:17,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:57:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:17,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:17,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:57:17,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:17,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-10-16 10:57:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:17,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:17,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_185))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808)) is different from false [2022-10-16 10:57:17,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_183 Int) (v_ArrVal_185 (Array Int Int))) (or (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_183)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_185))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_183 1)))) is different from false [2022-10-16 10:57:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-16 10:57:17,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783069193] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:17,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:17,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-10-16 10:57:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169937808] [2022-10-16 10:57:17,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:17,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:57:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:57:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=193, Unknown=2, NotChecked=58, Total=306 [2022-10-16 10:57:17,890 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:18,401 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2022-10-16 10:57:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 10:57:18,402 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 10:57:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:18,403 INFO L225 Difference]: With dead ends: 138 [2022-10-16 10:57:18,403 INFO L226 Difference]: Without dead ends: 137 [2022-10-16 10:57:18,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=388, Unknown=2, NotChecked=86, Total=600 [2022-10-16 10:57:18,405 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 103 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:18,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 385 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 200 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2022-10-16 10:57:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-16 10:57:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2022-10-16 10:57:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 107 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-10-16 10:57:18,421 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 19 [2022-10-16 10:57:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:18,421 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-10-16 10:57:18,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-10-16 10:57:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 10:57:18,423 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:18,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:18,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:18,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:18,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -450019723, now seen corresponding path program 1 times [2022-10-16 10:57:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713976582] [2022-10-16 10:57:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:19,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713976582] [2022-10-16 10:57:19,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713976582] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:19,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361269033] [2022-10-16 10:57:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:19,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:19,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 10:57:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:19,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 10:57:19,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:19,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:19,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:19,255 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:57:19,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-10-16 10:57:19,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:57:19,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:19,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:57:19,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-10-16 10:57:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:19,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:19,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224))) (+ 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 10:57:19,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 Int) (v_ArrVal_224 (Array Int Int))) (or (not (<= 1 v_ArrVal_222)) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_222)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) is different from false [2022-10-16 10:57:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-16 10:57:19,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361269033] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:19,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:19,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-10-16 10:57:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403158133] [2022-10-16 10:57:19,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:19,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:57:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:57:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=187, Unknown=2, NotChecked=58, Total=306 [2022-10-16 10:57:19,657 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:20,164 INFO L93 Difference]: Finished difference Result 219 states and 266 transitions. [2022-10-16 10:57:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:20,165 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-16 10:57:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:20,167 INFO L225 Difference]: With dead ends: 219 [2022-10-16 10:57:20,167 INFO L226 Difference]: Without dead ends: 218 [2022-10-16 10:57:20,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=498, Unknown=2, NotChecked=98, Total=756 [2022-10-16 10:57:20,169 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 187 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:20,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 322 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 150 Invalid, 0 Unknown, 143 Unchecked, 0.2s Time] [2022-10-16 10:57:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-10-16 10:57:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 110. [2022-10-16 10:57:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 109 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2022-10-16 10:57:20,184 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 20 [2022-10-16 10:57:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:20,185 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2022-10-16 10:57:20,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-10-16 10:57:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 10:57:20,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:20,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:20,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:20,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:20,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1322746103, now seen corresponding path program 1 times [2022-10-16 10:57:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:20,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664327133] [2022-10-16 10:57:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:20,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664327133] [2022-10-16 10:57:20,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664327133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:20,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:20,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154685187] [2022-10-16 10:57:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:20,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:20,453 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:20,504 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2022-10-16 10:57:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:20,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 10:57:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:20,506 INFO L225 Difference]: With dead ends: 151 [2022-10-16 10:57:20,506 INFO L226 Difference]: Without dead ends: 149 [2022-10-16 10:57:20,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:57:20,508 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:20,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 110 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-10-16 10:57:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 116. [2022-10-16 10:57:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 115 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2022-10-16 10:57:20,534 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 22 [2022-10-16 10:57:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:20,534 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2022-10-16 10:57:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2022-10-16 10:57:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:57:20,536 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:20,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:20,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 10:57:20,536 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1488947009, now seen corresponding path program 1 times [2022-10-16 10:57:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:20,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834466519] [2022-10-16 10:57:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:20,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834466519] [2022-10-16 10:57:20,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834466519] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427128992] [2022-10-16 10:57:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:20,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:20,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:20,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:20,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 10:57:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:20,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:20,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:20,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:20,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427128992] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:20,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367045298] [2022-10-16 10:57:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:20,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:20,695 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:20,777 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2022-10-16 10:57:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:57:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:20,778 INFO L225 Difference]: With dead ends: 149 [2022-10-16 10:57:20,778 INFO L226 Difference]: Without dead ends: 148 [2022-10-16 10:57:20,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:57:20,780 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:20,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 159 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-16 10:57:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 115. [2022-10-16 10:57:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 114 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-10-16 10:57:20,793 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 23 [2022-10-16 10:57:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:20,793 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-10-16 10:57:20,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-10-16 10:57:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:57:20,795 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:20,795 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:20,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:21,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:21,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:57:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176301605] [2022-10-16 10:57:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:21,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:21,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176301605] [2022-10-16 10:57:21,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176301605] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:21,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123507260] [2022-10-16 10:57:21,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:21,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:21,176 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:21,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 10:57:21,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:57:21,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:21,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:57:21,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:57:21,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:57:21,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123507260] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:21,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:21,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:57:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853767145] [2022-10-16 10:57:21,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:57:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:57:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:57:21,357 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:21,624 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2022-10-16 10:57:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:57:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:21,626 INFO L225 Difference]: With dead ends: 158 [2022-10-16 10:57:21,626 INFO L226 Difference]: Without dead ends: 157 [2022-10-16 10:57:21,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:57:21,628 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 175 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:21,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 197 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-16 10:57:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 104. [2022-10-16 10:57:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.326086956521739) internal successors, (122), 103 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2022-10-16 10:57:21,640 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 24 [2022-10-16 10:57:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:21,641 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2022-10-16 10:57:21,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2022-10-16 10:57:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:57:21,642 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:21,642 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:21,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:21,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:21,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -395689331, now seen corresponding path program 1 times [2022-10-16 10:57:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:21,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357379889] [2022-10-16 10:57:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357379889] [2022-10-16 10:57:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357379889] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065649144] [2022-10-16 10:57:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:21,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:21,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:21,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 10:57:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:22,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:22,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:22,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:22,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065649144] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:22,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:22,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421234548] [2022-10-16 10:57:22,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:22,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:22,224 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:22,469 INFO L93 Difference]: Finished difference Result 223 states and 251 transitions. [2022-10-16 10:57:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 10:57:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:22,477 INFO L225 Difference]: With dead ends: 223 [2022-10-16 10:57:22,477 INFO L226 Difference]: Without dead ends: 190 [2022-10-16 10:57:22,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:22,482 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 190 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:22,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 288 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-16 10:57:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2022-10-16 10:57:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.3) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2022-10-16 10:57:22,497 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 25 [2022-10-16 10:57:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:22,498 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2022-10-16 10:57:22,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2022-10-16 10:57:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:57:22,504 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:22,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:22,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:22,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 10:57:22,719 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1201818393, now seen corresponding path program 2 times [2022-10-16 10:57:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523926914] [2022-10-16 10:57:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:22,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:22,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:22,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523926914] [2022-10-16 10:57:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523926914] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:22,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225012095] [2022-10-16 10:57:22,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:22,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:22,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:22,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:22,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 10:57:22,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:57:22,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:22,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:57:22,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:23,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:23,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225012095] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:23,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:23,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:57:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372348073] [2022-10-16 10:57:23,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:23,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:23,060 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:23,499 INFO L93 Difference]: Finished difference Result 309 states and 362 transitions. [2022-10-16 10:57:23,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:57:23,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 10:57:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:23,501 INFO L225 Difference]: With dead ends: 309 [2022-10-16 10:57:23,501 INFO L226 Difference]: Without dead ends: 263 [2022-10-16 10:57:23,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:57:23,503 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 428 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:23,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 273 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-10-16 10:57:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 123. [2022-10-16 10:57:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 122 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2022-10-16 10:57:23,518 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 26 [2022-10-16 10:57:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:23,519 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2022-10-16 10:57:23,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-10-16 10:57:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 10:57:23,520 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:23,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:23,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 10:57:23,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1994597725, now seen corresponding path program 1 times [2022-10-16 10:57:23,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:23,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139431269] [2022-10-16 10:57:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:24,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139431269] [2022-10-16 10:57:24,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139431269] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:24,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986654508] [2022-10-16 10:57:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:24,631 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:24,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 10:57:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:24,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjunts are in the unsatisfiable core [2022-10-16 10:57:24,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:24,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:57:24,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:24,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:57:24,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:57:25,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-10-16 10:57:25,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-10-16 10:57:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:25,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:26,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986654508] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:26,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:26,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-10-16 10:57:26,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540396315] [2022-10-16 10:57:26,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:26,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:57:26,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:26,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:57:26,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:57:26,391 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:27,188 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2022-10-16 10:57:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-16 10:57:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:27,190 INFO L225 Difference]: With dead ends: 141 [2022-10-16 10:57:27,190 INFO L226 Difference]: Without dead ends: 140 [2022-10-16 10:57:27,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:57:27,192 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 117 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:27,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 499 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 204 Invalid, 0 Unknown, 190 Unchecked, 0.2s Time] [2022-10-16 10:57:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-10-16 10:57:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2022-10-16 10:57:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 120 states have (on average 1.275) internal successors, (153), 130 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-10-16 10:57:27,209 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 27 [2022-10-16 10:57:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:27,209 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-10-16 10:57:27,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-10-16 10:57:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:57:27,210 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:27,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:27,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:27,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 10:57:27,425 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1702987445, now seen corresponding path program 1 times [2022-10-16 10:57:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:27,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860611983] [2022-10-16 10:57:27,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:28,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860611983] [2022-10-16 10:57:28,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860611983] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:28,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886400351] [2022-10-16 10:57:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:28,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:28,281 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:28,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 10:57:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:28,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 10:57:28,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:28,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 11 treesize of output 7 [2022-10-16 10:57:28,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:57:28,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:28,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:57:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:28,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:29,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2022-10-16 10:57:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886400351] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:30,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:30,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-10-16 10:57:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198596515] [2022-10-16 10:57:30,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:30,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:57:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:57:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2022-10-16 10:57:30,336 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:31,130 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2022-10-16 10:57:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:57:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 10:57:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:31,132 INFO L225 Difference]: With dead ends: 228 [2022-10-16 10:57:31,132 INFO L226 Difference]: Without dead ends: 227 [2022-10-16 10:57:31,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=266, Invalid=993, Unknown=1, NotChecked=0, Total=1260 [2022-10-16 10:57:31,133 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 316 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:31,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 503 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 349 Invalid, 0 Unknown, 13 Unchecked, 0.3s Time] [2022-10-16 10:57:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-10-16 10:57:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 135. [2022-10-16 10:57:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 124 states have (on average 1.282258064516129) internal successors, (159), 134 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2022-10-16 10:57:31,151 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 28 [2022-10-16 10:57:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:31,151 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2022-10-16 10:57:31,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2022-10-16 10:57:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:57:31,152 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:31,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:31,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:31,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 10:57:31,366 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1409495825, now seen corresponding path program 2 times [2022-10-16 10:57:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:31,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368359440] [2022-10-16 10:57:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:31,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368359440] [2022-10-16 10:57:31,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368359440] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:31,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26205909] [2022-10-16 10:57:31,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:31,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:31,491 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:31,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 10:57:31,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:31,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:31,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:31,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:31,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:31,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26205909] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:31,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:31,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835646280] [2022-10-16 10:57:31,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:31,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:31,704 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:32,060 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2022-10-16 10:57:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:32,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 10:57:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:32,061 INFO L225 Difference]: With dead ends: 252 [2022-10-16 10:57:32,062 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 10:57:32,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:57:32,066 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 189 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:32,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 431 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 10:57:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2022-10-16 10:57:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2022-10-16 10:57:32,093 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 29 [2022-10-16 10:57:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:32,093 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2022-10-16 10:57:32,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2022-10-16 10:57:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:57:32,094 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:32,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:32,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:32,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 10:57:32,308 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 188398583, now seen corresponding path program 1 times [2022-10-16 10:57:32,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:32,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905358228] [2022-10-16 10:57:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:57:32,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:32,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905358228] [2022-10-16 10:57:32,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905358228] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:32,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:32,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874768515] [2022-10-16 10:57:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:32,376 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:32,437 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2022-10-16 10:57:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:32,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 10:57:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:32,438 INFO L225 Difference]: With dead ends: 163 [2022-10-16 10:57:32,438 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:57:32,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:57:32,439 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:32,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:57:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 141. [2022-10-16 10:57:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 140 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2022-10-16 10:57:32,463 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 30 [2022-10-16 10:57:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:32,464 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2022-10-16 10:57:32,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2022-10-16 10:57:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:57:32,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:32,465 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:32,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 10:57:32,466 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -939950877, now seen corresponding path program 1 times [2022-10-16 10:57:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:32,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127452403] [2022-10-16 10:57:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:32,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127452403] [2022-10-16 10:57:32,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127452403] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:32,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182912956] [2022-10-16 10:57:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:32,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:32,614 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:32,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 10:57:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:32,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:32,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:32,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:32,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182912956] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:32,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:32,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:32,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859472679] [2022-10-16 10:57:32,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:32,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:32,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:32,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:32,881 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:33,136 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2022-10-16 10:57:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 10:57:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:33,138 INFO L225 Difference]: With dead ends: 211 [2022-10-16 10:57:33,138 INFO L226 Difference]: Without dead ends: 190 [2022-10-16 10:57:33,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:33,139 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 110 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:33,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 307 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-16 10:57:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2022-10-16 10:57:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 148 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2022-10-16 10:57:33,160 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2022-10-16 10:57:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:33,160 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2022-10-16 10:57:33,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2022-10-16 10:57:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:57:33,161 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:33,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:33,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:33,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:33,372 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:33,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1206436117, now seen corresponding path program 3 times [2022-10-16 10:57:33,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:33,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915024580] [2022-10-16 10:57:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:33,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915024580] [2022-10-16 10:57:34,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915024580] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:34,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772341367] [2022-10-16 10:57:34,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:57:34,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:34,486 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:34,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 10:57:34,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:57:34,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:34,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-16 10:57:34,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:34,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:34,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:34,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:57:34,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:34,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:57:34,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:34,837 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 10:57:34,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-16 10:57:35,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:57:35,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:57:35,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:35,708 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:57:35,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-10-16 10:57:35,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:35,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:35,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2022-10-16 10:57:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:36,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:36,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_94| c_~N~0)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_94| 1))))) is different from false [2022-10-16 10:57:36,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_94| 1)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1))))) is different from false [2022-10-16 10:57:36,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_94|))))) is different from false [2022-10-16 10:57:36,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_94|))))) is different from false [2022-10-16 10:57:37,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int) (v_ArrVal_623 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_623 1)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|) (< |v_ULTIMATE.start_main_~i~0#1_100| |v_ULTIMATE.start_main_~i~0#1_94|) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) is different from false [2022-10-16 10:57:37,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 Int) (v_ArrVal_626 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int) (v_ArrVal_623 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_621) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (not (<= v_ArrVal_623 1)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|) (< |v_ULTIMATE.start_main_~i~0#1_100| |v_ULTIMATE.start_main_~i~0#1_94|) (< (+ v_ArrVal_628 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_621 1)))))) is different from false [2022-10-16 10:57:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-10-16 10:57:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772341367] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:37,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:37,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 44 [2022-10-16 10:57:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144661430] [2022-10-16 10:57:37,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:37,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 10:57:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:37,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 10:57:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1312, Unknown=31, NotChecked=474, Total=1980 [2022-10-16 10:57:37,475 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:38,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= .cse0 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 1) (<= .cse0 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_94|))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 1) (forall ((v_ArrVal_626 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int) (v_ArrVal_623 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_623)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_623 1)) (< |v_ULTIMATE.start_main_~i~0#1_94| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|) (< |v_ULTIMATE.start_main_~i~0#1_100| |v_ULTIMATE.start_main_~i~0#1_94|) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808)))))))) is different from false [2022-10-16 10:57:39,876 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_628 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (not (< |v_ULTIMATE.start_main_~i~0#1_94| c_~N~0)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< |v_ULTIMATE.start_main_~i~0#1_94| 1)))) (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_626))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_94| c_~N~0)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_628) (< (+ v_ArrVal_628 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_628)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_94| 1)))))) is different from false [2022-10-16 10:57:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:40,458 INFO L93 Difference]: Finished difference Result 180 states and 211 transitions. [2022-10-16 10:57:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-16 10:57:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 10:57:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:40,460 INFO L225 Difference]: With dead ends: 180 [2022-10-16 10:57:40,460 INFO L226 Difference]: Without dead ends: 179 [2022-10-16 10:57:40,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=334, Invalid=2744, Unknown=34, NotChecked=920, Total=4032 [2022-10-16 10:57:40,463 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:40,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 518 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 321 Unchecked, 0.1s Time] [2022-10-16 10:57:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-16 10:57:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-10-16 10:57:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2022-10-16 10:57:40,487 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 33 [2022-10-16 10:57:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:40,487 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2022-10-16 10:57:40,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2022-10-16 10:57:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:57:40,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:40,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:40,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-10-16 10:57:40,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:40,703 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1255185945, now seen corresponding path program 1 times [2022-10-16 10:57:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:40,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069652431] [2022-10-16 10:57:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:41,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069652431] [2022-10-16 10:57:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069652431] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:41,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967601067] [2022-10-16 10:57:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:41,277 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:41,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 10:57:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:41,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:57:41,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:41,381 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:57:41,382 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 108 treesize of output 102 [2022-10-16 10:57:41,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:57:41,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:57:41,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:57:41,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:57:41,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:57:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:57:41,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:46,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_679 Int)) (or (< (+ v_ArrVal_679 9223372036854775808) 0) (< 0 (+ v_ArrVal_679 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_677))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_679))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-16 10:57:47,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:47,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2022-10-16 10:57:47,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:47,057 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 274 treesize of output 266 [2022-10-16 10:57:47,067 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 284 treesize of output 264 [2022-10-16 10:57:47,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 210 [2022-10-16 10:57:47,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:57:47,445 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 172 treesize of output 156 [2022-10-16 10:57:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2022-10-16 10:57:47,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967601067] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:47,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:47,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-10-16 10:57:47,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713004729] [2022-10-16 10:57:47,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:47,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 10:57:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 10:57:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=4, NotChecked=54, Total=870 [2022-10-16 10:57:47,576 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:48,358 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2022-10-16 10:57:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:57:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 10:57:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:48,360 INFO L225 Difference]: With dead ends: 245 [2022-10-16 10:57:48,360 INFO L226 Difference]: Without dead ends: 244 [2022-10-16 10:57:48,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=4, NotChecked=70, Total=1406 [2022-10-16 10:57:48,362 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 401 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:48,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 877 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 694 Invalid, 0 Unknown, 156 Unchecked, 0.4s Time] [2022-10-16 10:57:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-16 10:57:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 181. [2022-10-16 10:57:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 180 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2022-10-16 10:57:48,388 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 34 [2022-10-16 10:57:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:48,388 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2022-10-16 10:57:48,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2022-10-16 10:57:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:57:48,389 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:48,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:48,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:48,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:48,603 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 652120041, now seen corresponding path program 1 times [2022-10-16 10:57:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:48,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202550017] [2022-10-16 10:57:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:48,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202550017] [2022-10-16 10:57:48,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202550017] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:48,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993698796] [2022-10-16 10:57:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:48,690 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:48,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:57:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:48,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:48,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:48,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:48,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993698796] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:48,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:48,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:57:48,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239669717] [2022-10-16 10:57:48,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:48,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:57:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:48,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:57:48,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:57:48,844 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:49,019 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2022-10-16 10:57:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 10:57:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:49,023 INFO L225 Difference]: With dead ends: 239 [2022-10-16 10:57:49,024 INFO L226 Difference]: Without dead ends: 238 [2022-10-16 10:57:49,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:57:49,025 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:49,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 258 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-10-16 10:57:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 204. [2022-10-16 10:57:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 203 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 245 transitions. [2022-10-16 10:57:49,059 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 245 transitions. Word has length 36 [2022-10-16 10:57:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:49,060 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 245 transitions. [2022-10-16 10:57:49,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 245 transitions. [2022-10-16 10:57:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 10:57:49,061 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:49,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:49,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:49,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 10:57:49,267 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1259115111, now seen corresponding path program 1 times [2022-10-16 10:57:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:49,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064779312] [2022-10-16 10:57:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:49,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064779312] [2022-10-16 10:57:49,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064779312] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287079429] [2022-10-16 10:57:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:49,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:49,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:49,362 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:49,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 10:57:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:49,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:49,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:57:49,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:49,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287079429] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:49,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:49,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428108751] [2022-10-16 10:57:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:49,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:49,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:49,489 INFO L87 Difference]: Start difference. First operand 204 states and 245 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:49,579 INFO L93 Difference]: Finished difference Result 224 states and 266 transitions. [2022-10-16 10:57:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:49,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-10-16 10:57:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:49,581 INFO L225 Difference]: With dead ends: 224 [2022-10-16 10:57:49,581 INFO L226 Difference]: Without dead ends: 223 [2022-10-16 10:57:49,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:57:49,582 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:49,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-10-16 10:57:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2022-10-16 10:57:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 193 states have (on average 1.238341968911917) internal successors, (239), 202 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2022-10-16 10:57:49,612 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 37 [2022-10-16 10:57:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:49,612 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2022-10-16 10:57:49,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2022-10-16 10:57:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 10:57:49,614 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:49,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:49,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:49,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:49,829 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 359836473, now seen corresponding path program 1 times [2022-10-16 10:57:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:49,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819563665] [2022-10-16 10:57:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:57:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:49,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819563665] [2022-10-16 10:57:49,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819563665] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:49,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:49,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:49,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210721296] [2022-10-16 10:57:49,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:49,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:49,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:49,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:49,882 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:49,951 INFO L93 Difference]: Finished difference Result 223 states and 260 transitions. [2022-10-16 10:57:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-10-16 10:57:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:49,953 INFO L225 Difference]: With dead ends: 223 [2022-10-16 10:57:49,953 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 10:57:49,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:57:49,954 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:49,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 100 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 10:57:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-10-16 10:57:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 209 states have (on average 1.2248803827751196) internal successors, (256), 218 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 256 transitions. [2022-10-16 10:57:49,982 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 256 transitions. Word has length 40 [2022-10-16 10:57:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:49,983 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 256 transitions. [2022-10-16 10:57:49,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 256 transitions. [2022-10-16 10:57:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 10:57:49,984 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:49,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 10:57:49,984 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1946178913, now seen corresponding path program 2 times [2022-10-16 10:57:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:49,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995215442] [2022-10-16 10:57:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:50,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995215442] [2022-10-16 10:57:50,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995215442] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:50,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203478114] [2022-10-16 10:57:50,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:50,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:50,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:50,160 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:50,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 10:57:50,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:50,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:50,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:57:50,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:50,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:50,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203478114] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:50,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:50,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:57:50,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741984902] [2022-10-16 10:57:50,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:50,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:57:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:50,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:57:50,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:50,501 INFO L87 Difference]: Start difference. First operand 219 states and 256 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:50,838 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2022-10-16 10:57:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:57:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-10-16 10:57:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:50,840 INFO L225 Difference]: With dead ends: 271 [2022-10-16 10:57:50,840 INFO L226 Difference]: Without dead ends: 216 [2022-10-16 10:57:50,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:57:50,842 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 251 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:50,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 253 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-10-16 10:57:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 203. [2022-10-16 10:57:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 202 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 231 transitions. [2022-10-16 10:57:50,868 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 231 transitions. Word has length 40 [2022-10-16 10:57:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:50,868 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 231 transitions. [2022-10-16 10:57:50,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 231 transitions. [2022-10-16 10:57:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:57:50,869 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:50,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:50,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:51,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:51,086 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1014297451, now seen corresponding path program 2 times [2022-10-16 10:57:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852653440] [2022-10-16 10:57:51,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:57:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852653440] [2022-10-16 10:57:51,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852653440] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:51,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421428678] [2022-10-16 10:57:51,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:51,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:51,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:51,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 10:57:51,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:51,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:51,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:51,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:57:51,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:57:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421428678] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:51,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:51,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43415516] [2022-10-16 10:57:51,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:51,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:51,502 INFO L87 Difference]: Start difference. First operand 203 states and 231 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:51,862 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-10-16 10:57:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:57:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:51,866 INFO L225 Difference]: With dead ends: 286 [2022-10-16 10:57:51,866 INFO L226 Difference]: Without dead ends: 219 [2022-10-16 10:57:51,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:57:51,867 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:51,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 399 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-10-16 10:57:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2022-10-16 10:57:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.1871657754010696) internal successors, (222), 196 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions. [2022-10-16 10:57:51,888 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 41 [2022-10-16 10:57:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:51,889 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions. [2022-10-16 10:57:51,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions. [2022-10-16 10:57:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:57:51,889 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:51,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:51,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-10-16 10:57:52,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:52,091 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:57:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash 201956779, now seen corresponding path program 2 times [2022-10-16 10:57:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:52,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031718597] [2022-10-16 10:57:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:57:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:53,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031718597] [2022-10-16 10:57:53,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031718597] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:53,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447300604] [2022-10-16 10:57:53,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:53,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:53,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:53,851 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:57:53,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 10:57:53,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:53,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:53,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:57:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:53,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:53,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:53,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:57:54,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:57:54,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:57:54,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-10-16 10:57:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:54,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 10:57:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:55,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-10-16 10:57:55,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-10-16 10:57:55,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:55,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-10-16 10:57:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:56,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:01,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_136|)) (forall ((v_ArrVal_940 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_943))))))) is different from false [2022-10-16 10:58:03,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_940 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_136| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_943))))) is different from false [2022-10-16 10:58:28,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_940 Int) (v_ArrVal_938 Int) (v_ArrVal_936 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_936)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_938) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_938 1)) (< |v_ULTIMATE.start_main_~i~0#1_136| 1) (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_943) (not (<= v_ArrVal_936 1)))))) is different from false [2022-10-16 10:59:04,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_940 Int) (v_ArrVal_938 Int) (v_ArrVal_936 Int) (v_ArrVal_933 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_933) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_936))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_938) (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (not (<= v_ArrVal_933 1)) (not (<= v_ArrVal_938 1)) (< |v_ULTIMATE.start_main_~i~0#1_136| 1) (not (<= v_ArrVal_936 1)) (< (+ v_ArrVal_942 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_943) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_942))))) is different from false [2022-10-16 10:59:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 3 times theorem prover too weak. 0 trivial. 6 not checked. [2022-10-16 10:59:04,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447300604] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:04,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:04,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 56 [2022-10-16 10:59:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114941311] [2022-10-16 10:59:04,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:04,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:59:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:59:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2464, Unknown=26, NotChecked=420, Total=3192 [2022-10-16 10:59:04,361 INFO L87 Difference]: Start difference. First operand 197 states and 222 transitions. Second operand has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 57 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:07,468 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select .cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (and (= (select .cse0 0) 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse1) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse2 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_940 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse5 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_136| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_943))))) (<= .cse6 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse6 1) (<= .cse2 1)))) is different from false [2022-10-16 10:59:09,487 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 0 |c_ULTIMATE.start_main_#t~post8#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_136|)) (forall ((v_ArrVal_940 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) v_ArrVal_943))))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse3) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse4 0) 1) (<= .cse5 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse5 1) (<= (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) is different from false [2022-10-16 10:59:11,651 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|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse1) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse2 0) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int) (v_ArrVal_940 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_136| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_943))))) (<= .cse5 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse5 1) (<= (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) is different from false [2022-10-16 10:59:13,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse0 0) 1) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 8) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_136| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_136|)) (forall ((v_ArrVal_940 Int) (v_ArrVal_943 Int) (v_ArrVal_942 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_136| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_940)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_943 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_943)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_942) (< (+ v_ArrVal_942 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_942)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) v_ArrVal_943))))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 .cse3) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse4 0) 1) (<= .cse5 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse5 1) (<= (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) is different from false [2022-10-16 10:59:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:15,522 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2022-10-16 10:59:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 10:59:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 57 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:59:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:15,525 INFO L225 Difference]: With dead ends: 239 [2022-10-16 10:59:15,525 INFO L226 Difference]: Without dead ends: 237 [2022-10-16 10:59:15,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 79.5s TimeCoverageRelationStatistics Valid=633, Invalid=4771, Unknown=30, NotChecked=1208, Total=6642 [2022-10-16 10:59:15,536 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 123 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 875 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:15,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1084 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 751 Invalid, 0 Unknown, 875 Unchecked, 0.7s Time] [2022-10-16 10:59:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-10-16 10:59:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2022-10-16 10:59:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 194 states have (on average 1.1804123711340206) internal successors, (229), 203 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 229 transitions. [2022-10-16 10:59:15,579 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 229 transitions. Word has length 41 [2022-10-16 10:59:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:15,579 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 229 transitions. [2022-10-16 10:59:15,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 57 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2022-10-16 10:59:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:59:15,580 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:15,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:59:15,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-10-16 10:59:15,794 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:59:15,795 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:59:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1876545569, now seen corresponding path program 4 times [2022-10-16 10:59:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831005055] [2022-10-16 10:59:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:59:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:16,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831005055] [2022-10-16 10:59:16,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831005055] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:16,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647141251] [2022-10-16 10:59:16,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:59:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:16,005 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:59:16,007 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:59:16,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:59:16,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:59:16,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:59:16,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:59:16,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:59:16,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647141251] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:16,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:16,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-10-16 10:59:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46940423] [2022-10-16 10:59:16,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:16,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:59:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:16,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:59:16,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:59:16,542 INFO L87 Difference]: Start difference. First operand 204 states and 229 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:17,848 INFO L93 Difference]: Finished difference Result 295 states and 323 transitions. [2022-10-16 10:59:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-16 10:59:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 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:59:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:17,849 INFO L225 Difference]: With dead ends: 295 [2022-10-16 10:59:17,849 INFO L226 Difference]: Without dead ends: 222 [2022-10-16 10:59:17,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=493, Invalid=3413, Unknown=0, NotChecked=0, Total=3906 [2022-10-16 10:59:17,852 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 374 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:17,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 768 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:59:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-16 10:59:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2022-10-16 10:59:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 198 states have (on average 1.1717171717171717) internal successors, (232), 207 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 232 transitions. [2022-10-16 10:59:17,881 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 232 transitions. Word has length 43 [2022-10-16 10:59:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:17,881 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 232 transitions. [2022-10-16 10:59:17,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 232 transitions. [2022-10-16 10:59:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:59:17,882 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:17,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:59:17,921 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:59:18,096 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:59:18,096 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:59:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1059020833, now seen corresponding path program 5 times [2022-10-16 10:59:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:18,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773252949] [2022-10-16 10:59:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:59:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:18,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773252949] [2022-10-16 10:59:18,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773252949] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:18,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427204211] [2022-10-16 10:59:18,350 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:59:18,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:18,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:18,351 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:59:18,352 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:59:18,495 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-10-16 10:59:18,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:59:18,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:59:18,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:59:18,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:59:18,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427204211] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:18,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:18,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:59:18,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538950569] [2022-10-16 10:59:18,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:18,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:59:18,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:18,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:59:18,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:59:18,922 INFO L87 Difference]: Start difference. First operand 208 states and 232 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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:59:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:19,530 INFO L93 Difference]: Finished difference Result 354 states and 398 transitions. [2022-10-16 10:59:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 10:59:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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 45 [2022-10-16 10:59:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:19,532 INFO L225 Difference]: With dead ends: 354 [2022-10-16 10:59:19,532 INFO L226 Difference]: Without dead ends: 281 [2022-10-16 10:59:19,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2022-10-16 10:59:19,533 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 223 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:19,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 615 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:59:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-10-16 10:59:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 212. [2022-10-16 10:59:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.1683168316831682) internal successors, (236), 211 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2022-10-16 10:59:19,571 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 45 [2022-10-16 10:59:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:19,572 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2022-10-16 10:59:19,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 28 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:59:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2022-10-16 10:59:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:59:19,573 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:19,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:59:19,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 10:59:19,779 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:59:19,780 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:59:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1921778353, now seen corresponding path program 3 times [2022-10-16 10:59:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:19,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302496718] [2022-10-16 10:59:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:59:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:22,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302496718] [2022-10-16 10:59:22,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302496718] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:22,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748713403] [2022-10-16 10:59:22,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:59:22,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:22,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:22,947 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:59:22,949 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:59:23,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:59:23,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:59:23,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-16 10:59:23,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:23,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:23,063 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:59:23,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-10-16 10:59:23,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:59:23,475 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 10:59:23,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-10-16 10:59:24,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:24,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-10-16 10:59:24,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:24,213 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:59:24,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2022-10-16 10:59:24,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:24,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2022-10-16 10:59:25,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,242 INFO L356 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-10-16 10:59:25,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 38 [2022-10-16 10:59:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 10:59:25,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:26,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1107 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1107)))) (or (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) 9223372036854775808) (not (< |v_ULTIMATE.start_main_~i~0#1_159| c_~N~0)) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1107)) (< |v_ULTIMATE.start_main_~i~0#1_159| 1)))) is different from false [2022-10-16 10:59:26,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:59:26,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2022-10-16 10:59:26,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< |v_ULTIMATE.start_main_~i~0#1_159| c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_159| 1)))) is different from false [2022-10-16 10:59:26,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_159| 1)) (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_159| 1)))) is different from false [2022-10-16 10:59:26,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< |c_ULTIMATE.start_main_#t~post8#1| |v_ULTIMATE.start_main_~i~0#1_159|) (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_159| 1)))) is different from false [2022-10-16 10:59:26,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_159|) (< |v_ULTIMATE.start_main_~i~0#1_159| 1)))) is different from false [2022-10-16 10:59:26,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1105 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1105)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_159|) (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_159| 1) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= v_ArrVal_1105 1))))) is different from false [2022-10-16 10:59:26,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_165| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1105 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_165| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1105)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_165| |v_ULTIMATE.start_main_~i~0#1_159|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_165|) (< |v_ULTIMATE.start_main_~i~0#1_159| 1) (not (<= v_ArrVal_1105 1))))) is different from false [2022-10-16 10:59:26,735 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-10-16 10:59:26,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 77 [2022-10-16 10:59:26,795 INFO L356 Elim1Store]: treesize reduction 20, result has 70.1 percent of original size [2022-10-16 10:59:26,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 240 treesize of output 250 [2022-10-16 10:59:26,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:59:26,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 142 [2022-10-16 10:59:26,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:59:26,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:59:26,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 149 [2022-10-16 10:59:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 14 not checked. [2022-10-16 10:59:27,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748713403] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:27,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:27,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17, 19] total 61 [2022-10-16 10:59:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925514663] [2022-10-16 10:59:27,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:27,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-16 10:59:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-16 10:59:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2679, Unknown=13, NotChecked=784, Total=3782 [2022-10-16 10:59:27,942 INFO L87 Difference]: Start difference. First operand 212 states and 236 transitions. Second operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 62 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:59:28,668 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (and (or (<= 1 (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= .cse1 0)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (or (not (= c_~N~0 2)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (<= 1 .cse2) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_165| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1105 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_165| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1105)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_165| |v_ULTIMATE.start_main_~i~0#1_159|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_165|) (< |v_ULTIMATE.start_main_~i~0#1_159| 1) (not (<= v_ArrVal_1105 1))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse2 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:59:29,278 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (and (or (<= 1 (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= .cse1 0)) (= (select .cse2 0) 1) (<= c_~N~0 2) (<= .cse3 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 .cse4) (< 1 c_~N~0) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse4 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_165| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1105 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_165| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1105)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_165| |v_ULTIMATE.start_main_~i~0#1_159|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_165|) (< |v_ULTIMATE.start_main_~i~0#1_159| 1) (not (<= v_ArrVal_1105 1))))) (= (select .cse2 (* c_~N~0 4)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse3 1) (<= .cse4 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:59:30,013 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (and (or (<= 1 (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= .cse1 0)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 .cse2) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_165| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1105 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_165| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1105)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (or (< (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1109))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_165| |v_ULTIMATE.start_main_~i~0#1_159|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_165|) (< |v_ULTIMATE.start_main_~i~0#1_159| 1) (not (<= v_ArrVal_1105 1))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= .cse2 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 11:00:22,587 WARN L233 SmtUtils]: Spent 52.23s on a formula simplification. DAG size of input: 108 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 11:00:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:26,633 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2022-10-16 11:00:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-16 11:00:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 62 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 47 [2022-10-16 11:00:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:26,634 INFO L225 Difference]: With dead ends: 222 [2022-10-16 11:00:26,634 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 11:00:26,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=803, Invalid=6874, Unknown=19, NotChecked=1810, Total=9506 [2022-10-16 11:00:26,638 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 66 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:26,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 618 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 378 Invalid, 0 Unknown, 719 Unchecked, 0.3s Time] [2022-10-16 11:00:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 11:00:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2022-10-16 11:00:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 210 states have (on average 1.1857142857142857) internal successors, (249), 219 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:00:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2022-10-16 11:00:26,675 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 47 [2022-10-16 11:00:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:26,675 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2022-10-16 11:00:26,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 62 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 11:00:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2022-10-16 11:00:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 11:00:26,676 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:26,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:26,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 11:00:26,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:26,890 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash 189048547, now seen corresponding path program 6 times [2022-10-16 11:00:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:26,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815829475] [2022-10-16 11:00:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:00:28,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:28,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815829475] [2022-10-16 11:00:28,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815829475] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:28,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483632394] [2022-10-16 11:00:28,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 11:00:28,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:28,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:28,850 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:28,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 11:00:28,970 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-10-16 11:00:28,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:00:28,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-10-16 11:00:28,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:28,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:28,992 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 11:00:29,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 11:00:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:00:29,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 11:00:29,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 11:00:29,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 11:00:29,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 11:00:29,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:29,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-10-16 11:00:30,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:00:30,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-10-16 11:00:30,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:30,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:00:30,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2022-10-16 11:00:31,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:31,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2022-10-16 11:00:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:00:31,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:34,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1179) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1177))))) is different from false [2022-10-16 11:00:34,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1179 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1177) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179) (not (<= v_ArrVal_1172 1)))))) is different from false [2022-10-16 11:00:34,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |c_ULTIMATE.start_main_#t~post7#1|)) v_ArrVal_1172)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1172 1)) (< (+ v_ArrVal_1179 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1177) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179))))) is different from false [2022-10-16 11:00:34,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1177 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_1179) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1179) 9223372036854775808) (not (<= v_ArrVal_1172 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177))))) is different from false [2022-10-16 11:00:34,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1179 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_1172 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179))))) is different from false [2022-10-16 11:00:34,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_#t~post7#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) 1) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) v_ArrVal_1172))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179) (not (<= v_ArrVal_1172 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1177) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1179) 9223372036854775808))))) is different from false [2022-10-16 11:00:34,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 16 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1179 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) (not (<= v_ArrVal_1172 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179))))) is different from false [2022-10-16 11:00:34,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1177 Int) (v_ArrVal_1179 Int) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse2 16 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1176))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1177)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) v_ArrVal_1179) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1179)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1179) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1177) (not (<= v_ArrVal_1172 1)))))) is different from false [2022-10-16 11:00:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 24 not checked. [2022-10-16 11:00:34,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483632394] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:34,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:34,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 59 [2022-10-16 11:00:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646241217] [2022-10-16 11:00:34,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:34,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-16 11:00:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-16 11:00:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2431, Unknown=9, NotChecked=856, Total=3540 [2022-10-16 11:00:34,842 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand has 60 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 60 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 11:00:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:38,034 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2022-10-16 11:00:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 11:00:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 60 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) Word has length 47 [2022-10-16 11:00:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:38,036 INFO L225 Difference]: With dead ends: 222 [2022-10-16 11:00:38,036 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 11:00:38,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=464, Invalid=4389, Unknown=9, NotChecked=1144, Total=6006 [2022-10-16 11:00:38,039 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:38,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1005 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 880 Invalid, 0 Unknown, 766 Unchecked, 0.7s Time] [2022-10-16 11:00:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 11:00:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 198. [2022-10-16 11:00:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 188 states have (on average 1.1914893617021276) internal successors, (224), 197 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:00:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2022-10-16 11:00:38,078 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 47 [2022-10-16 11:00:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:38,079 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions. [2022-10-16 11:00:38,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 60 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 11:00:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2022-10-16 11:00:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 11:00:38,080 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:38,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:38,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-10-16 11:00:38,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:38,289 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1245349172, now seen corresponding path program 1 times [2022-10-16 11:00:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:38,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522777212] [2022-10-16 11:00:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:38,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 11:00:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:38,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522777212] [2022-10-16 11:00:38,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522777212] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:38,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12764063] [2022-10-16 11:00:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:38,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:38,360 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:00:38,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-10-16 11:00:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:38,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 11:00:38,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 11:00:38,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 11:00:38,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12764063] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:38,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 11:00:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129861614] [2022-10-16 11:00:38,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 11:00:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 11:00:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 11:00:38,692 INFO L87 Difference]: Start difference. First operand 198 states and 224 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:00:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:00:39,023 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2022-10-16 11:00:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 11:00:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-10-16 11:00:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:00:39,024 INFO L225 Difference]: With dead ends: 242 [2022-10-16 11:00:39,024 INFO L226 Difference]: Without dead ends: 200 [2022-10-16 11:00:39,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-10-16 11:00:39,025 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 95 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:00:39,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 276 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 11:00:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-10-16 11:00:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2022-10-16 11:00:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 180 states have (on average 1.2) internal successors, (216), 189 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:00:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2022-10-16 11:00:39,057 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 48 [2022-10-16 11:00:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:00:39,057 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2022-10-16 11:00:39,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:00:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2022-10-16 11:00:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 11:00:39,058 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:00:39,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:00:39,099 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 11:00:39,271 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 11:00:39,272 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 11:00:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:00:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -554413087, now seen corresponding path program 1 times [2022-10-16 11:00:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:00:39,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753451627] [2022-10-16 11:00:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:00:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 11:00:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:00:39,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753451627] [2022-10-16 11:00:39,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753451627] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:00:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821881607] [2022-10-16 11:00:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:00:39,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:00:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:00:39,897 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 11:00:39,898 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 11:00:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:00:39,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 11:00:40,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:00:40,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:40,017 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 11:00:40,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-10-16 11:00:40,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 11:00:40,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 11:00:40,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 11:00:40,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:40,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 11:00:40,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:40,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-10-16 11:00:41,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:41,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2022-10-16 11:00:41,189 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 21 treesize of output 13 [2022-10-16 11:00:41,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:00:41,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 11:00:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:00:41,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:00:41,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2022-10-16 11:00:41,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2022-10-16 11:00:41,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|) v_ArrVal_1280)))) is different from false [2022-10-16 11:00:41,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (< v_ArrVal_1280 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 11:00:41,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (< v_ArrVal_1280 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post9#1| 8) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 11:00:41,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (< v_ArrVal_1280 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 11:00:41,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1280 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1278))))) is different from false [2022-10-16 11:00:41,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1280 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1278))))) is different from false [2022-10-16 11:00:41,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_1276 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_1276)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< v_ArrVal_1280 (+ v_ArrVal_1278 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4))))) (not (<= 1 v_ArrVal_1276)))))) is different from false [2022-10-16 11:00:41,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_1276 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_#t~post8#1| 4) 4) v_ArrVal_1276)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_1280 (+ v_ArrVal_1278 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4))))) (not (<= 1 v_ArrVal_1276)))))) is different from false [2022-10-16 11:00:41,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_1276 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_1276)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< v_ArrVal_1280 (+ v_ArrVal_1278 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< 0 (let ((.cse2 (store (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) 9223372036854775809 (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= 1 v_ArrVal_1276)))))) is different from false [2022-10-16 11:00:41,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:41,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 87 [2022-10-16 11:00:41,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< 0 (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 4)) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1280 (+ v_ArrVal_1278 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 1 (select v_arrayElimArr_4 (+ |ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)))))))) is different from false [2022-10-16 11:00:41,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1280 Int) (v_ArrVal_1282 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (+ |ULTIMATE.start_main_~b~0#1.offset| 4))) (or (< (+ 9223372036854775808 v_ArrVal_1278) 0) (< 0 (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1280)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1282))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1) 9223372036854775809 (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (< v_ArrVal_1280 (+ v_ArrVal_1278 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 1 (select v_arrayElimArr_4 .cse1))))))) is different from false [2022-10-16 11:00:42,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:42,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 88 [2022-10-16 11:00:42,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:42,095 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 689 treesize of output 683 [2022-10-16 11:00:42,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:42,124 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 779 treesize of output 729 [2022-10-16 11:00:42,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:42,157 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 546 treesize of output 480 [2022-10-16 11:00:42,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:42,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 176 [2022-10-16 11:00:45,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:00:45,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 514 treesize of output 1601