/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/sina2f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:56:44,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:56:44,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:56:44,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:56:44,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:56:44,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:56:44,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:56:44,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:56:44,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:56:44,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:56:44,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:56:44,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:56:44,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:56:44,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:56:44,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:56:44,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:56:44,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:56:44,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:56:44,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:56:44,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:56:44,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:56:44,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:56:44,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:56:44,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:56:44,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:56:44,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:56:44,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:56:44,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:56:44,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:56:44,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:56:44,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:56:44,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:56:44,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:56:44,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:56:44,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:56:44,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:56:44,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:56:44,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:56:44,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:56:44,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:56:44,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:56:44,597 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:56:44,651 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:56:44,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:56:44,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:56:44,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:56:44,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:56:44,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:56:44,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:56:44,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:56:44,658 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:56:44,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:56:44,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:56:44,659 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:56:44,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:56:44,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:56:44,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:56:44,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:56:44,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:56:44,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:56:44,661 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:56:44,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:56:44,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:56:44,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:56:44,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:56:44,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:56:44,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:56:44,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:56:44,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:56:44,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:56:44,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:56:44,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:56:44,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:56:44,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:56:44,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:56:44,664 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:56:45,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:56:45,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:56:45,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:56:45,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:56:45,156 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:56:45,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina2f.c [2022-10-16 10:56:45,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7793b85/18f0bc71ad974e0389b762845ee92fc1/FLAGafc733394 [2022-10-16 10:56:45,922 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:56:45,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina2f.c [2022-10-16 10:56:45,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7793b85/18f0bc71ad974e0389b762845ee92fc1/FLAGafc733394 [2022-10-16 10:56:46,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7793b85/18f0bc71ad974e0389b762845ee92fc1 [2022-10-16 10:56:46,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:56:46,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:56:46,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:56:46,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:56:46,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:56:46,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799b7e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46, skipping insertion in model container [2022-10-16 10:56:46,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:56:46,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:56:46,546 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/sina2f.c[589,602] [2022-10-16 10:56:46,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:56:46,581 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:56:46,596 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/sina2f.c[589,602] [2022-10-16 10:56:46,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:56:46,625 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:56:46,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46 WrapperNode [2022-10-16 10:56:46,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:56:46,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:56:46,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:56:46,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:56:46,640 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:56:46" (1/1) ... [2022-10-16 10:56:46,663 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:56:46" (1/1) ... [2022-10-16 10:56:46,706 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-10-16 10:56:46,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:56:46,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:56:46,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:56:46,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:56:46,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,739 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:56:46,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:56:46,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:56:46,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:56:46,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (1/1) ... [2022-10-16 10:56:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:56:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:46,781 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:56:46,810 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:56:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:56:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:56:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:56:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:56:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:56:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:56:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:56:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:56:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:56:46,974 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:56:46,976 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:56:47,321 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:56:47,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:56:47,331 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 10:56:47,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:56:47 BoogieIcfgContainer [2022-10-16 10:56:47,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:56:47,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:56:47,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:56:47,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:56:47,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:56:46" (1/3) ... [2022-10-16 10:56:47,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c5c799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:56:47, skipping insertion in model container [2022-10-16 10:56:47,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:56:46" (2/3) ... [2022-10-16 10:56:47,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c5c799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:56:47, skipping insertion in model container [2022-10-16 10:56:47,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:56:47" (3/3) ... [2022-10-16 10:56:47,346 INFO L112 eAbstractionObserver]: Analyzing ICFG sina2f.c [2022-10-16 10:56:47,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:56:47,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-10-16 10:56:47,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:56:47,455 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;@dfc5f41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:56:47,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-10-16 10:56:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 46 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:56:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:56:47,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:47,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:47,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:47,481 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:56:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200793362] [2022-10-16 10:56:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:47,757 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:56:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:47,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200793362] [2022-10-16 10:56:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200793362] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:56:47,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:56:47,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:56:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558904431] [2022-10-16 10:56:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:56:47,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:56:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:47,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:56:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:56:47,806 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 46 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) 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:56:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:47,829 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-10-16 10:56:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:56:47,832 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:56:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:47,842 INFO L225 Difference]: With dead ends: 90 [2022-10-16 10:56:47,842 INFO L226 Difference]: Without dead ends: 42 [2022-10-16 10:56:47,846 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:56:47,851 INFO L413 NwaCegarLoop]: 51 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, 51 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:56:47,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:56:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-16 10:56:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-16 10:56:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.5) internal successors, (45), 41 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:56:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-10-16 10:56:47,893 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2022-10-16 10:56:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:47,894 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-10-16 10:56:47,894 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:56:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-10-16 10:56:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:56:47,895 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:47,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:47,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:56:47,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:56:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:47,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380867432] [2022-10-16 10:56:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:47,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:48,103 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:56:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:48,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380867432] [2022-10-16 10:56:48,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380867432] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:56:48,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:56:48,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:56:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281957909] [2022-10-16 10:56:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:56:48,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:56:48,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:48,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:56:48,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:56:48,109 INFO L87 Difference]: Start difference. First operand 42 states and 45 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:56:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:48,267 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-10-16 10:56:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:56:48,268 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:56:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:48,270 INFO L225 Difference]: With dead ends: 79 [2022-10-16 10:56:48,270 INFO L226 Difference]: Without dead ends: 77 [2022-10-16 10:56:48,271 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:56:48,273 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:48,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:56:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-16 10:56:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2022-10-16 10:56:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-10-16 10:56:48,286 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2022-10-16 10:56:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:48,287 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-10-16 10:56:48,287 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:56:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-10-16 10:56:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 10:56:48,288 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:48,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:48,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:56:48,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:48,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1268805299, now seen corresponding path program 1 times [2022-10-16 10:56:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:48,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178238045] [2022-10-16 10:56:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:48,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:48,440 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:56:48,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:48,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178238045] [2022-10-16 10:56:48,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178238045] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:56:48,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:56:48,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:56:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524908916] [2022-10-16 10:56:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:56:48,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:56:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:56:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:56:48,447 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:48,598 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-10-16 10:56:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:56:48,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-10-16 10:56:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:48,600 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:56:48,601 INFO L226 Difference]: Without dead ends: 74 [2022-10-16 10:56:48,601 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:56:48,609 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 101 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:48,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 54 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:56:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-16 10:56:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2022-10-16 10:56:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-10-16 10:56:48,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 9 [2022-10-16 10:56:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:48,633 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-10-16 10:56:48,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-10-16 10:56:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:56:48,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:48,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:48,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:56:48,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:48,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:48,639 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:56:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:48,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103664437] [2022-10-16 10:56:48,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:48,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:48,855 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:56:48,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103664437] [2022-10-16 10:56:48,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103664437] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122213755] [2022-10-16 10:56:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:48,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:48,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:48,859 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:56:48,867 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:56:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:48,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:56:48,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:49,019 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:56:49,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:49,079 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:56:49,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122213755] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:49,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:56:49,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:56:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832113951] [2022-10-16 10:56:49,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:49,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:56:49,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:49,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:56:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:56:49,083 INFO L87 Difference]: Start difference. First operand 48 states and 51 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:56:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:49,364 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-10-16 10:56:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:56:49,365 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:56:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:49,379 INFO L225 Difference]: With dead ends: 93 [2022-10-16 10:56:49,379 INFO L226 Difference]: Without dead ends: 92 [2022-10-16 10:56:49,382 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:56:49,392 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:49,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 137 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:56:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-16 10:56:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 59. [2022-10-16 10:56:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.425531914893617) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-10-16 10:56:49,420 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 12 [2022-10-16 10:56:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:49,421 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-10-16 10:56:49,421 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:56:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-10-16 10:56:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:56:49,423 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:49,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:49,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 10:56:49,630 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:56:49,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:49,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1550653641, now seen corresponding path program 1 times [2022-10-16 10:56:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:49,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072060040] [2022-10-16 10:56:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:50,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072060040] [2022-10-16 10:56:50,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072060040] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:50,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225234888] [2022-10-16 10:56:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:50,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:50,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:50,351 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:56:50,364 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:56:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:50,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:56:50,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:50,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:56:50,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:56:50,523 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:56:50,631 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:56:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:50,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:50,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225234888] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:50,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:56:50,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-10-16 10:56:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068013828] [2022-10-16 10:56:50,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:50,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:56:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:56:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:56:50,826 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:51,039 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-10-16 10:56:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 10:56:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 10:56:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:51,041 INFO L225 Difference]: With dead ends: 79 [2022-10-16 10:56:51,041 INFO L226 Difference]: Without dead ends: 77 [2022-10-16 10:56:51,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:56:51,043 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:51,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 222 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 102 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-10-16 10:56:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-16 10:56:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2022-10-16 10:56:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-10-16 10:56:51,054 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 13 [2022-10-16 10:56:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:51,055 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-10-16 10:56:51,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-10-16 10:56:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:56:51,056 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:51,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:51,096 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:56:51,271 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:56:51,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:56:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:51,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280603318] [2022-10-16 10:56:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:51,393 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:56:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:51,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280603318] [2022-10-16 10:56:51,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280603318] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:51,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392567724] [2022-10-16 10:56:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:51,398 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:56:51,408 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:56:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:56:51,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:51,485 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:56:51,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:56:51,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392567724] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:56:51,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:56:51,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:56:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810649145] [2022-10-16 10:56:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:56:51,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:56:51,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:51,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:56:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:56:51,489 INFO L87 Difference]: Start difference. First operand 61 states and 69 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:56:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:51,570 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-10-16 10:56:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:56:51,571 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:56:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:51,572 INFO L225 Difference]: With dead ends: 83 [2022-10-16 10:56:51,572 INFO L226 Difference]: Without dead ends: 82 [2022-10-16 10:56:51,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:56:51,573 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:51,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 98 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:56:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-16 10:56:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2022-10-16 10:56:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.346938775510204) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-10-16 10:56:51,583 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2022-10-16 10:56:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:51,584 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-10-16 10:56:51,584 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:56:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-10-16 10:56:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 10:56:51,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:51,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:51,625 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:56:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:51,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1145690293, now seen corresponding path program 1 times [2022-10-16 10:56:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:51,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932696710] [2022-10-16 10:56:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:51,853 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:56:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932696710] [2022-10-16 10:56:51,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932696710] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:56:51,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:56:51,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:56:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334759097] [2022-10-16 10:56:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:56:51,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:56:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:56:51,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:56:51,856 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:51,904 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-10-16 10:56:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:56:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 10:56:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:51,905 INFO L225 Difference]: With dead ends: 82 [2022-10-16 10:56:51,906 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:56:51,906 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:56:51,907 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:51,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:56:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:56:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2022-10-16 10:56:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-10-16 10:56:51,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-10-16 10:56:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:51,917 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-10-16 10:56:51,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-10-16 10:56:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 10:56:51,919 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:51,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:51,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 10:56:51,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:51,920 INFO L85 PathProgramCache]: Analyzing trace with hash -845503427, now seen corresponding path program 1 times [2022-10-16 10:56:51,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:51,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729696666] [2022-10-16 10:56:51,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:52,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:52,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729696666] [2022-10-16 10:56:52,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729696666] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822104673] [2022-10-16 10:56:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:52,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:52,044 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:56:52,046 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:56:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:52,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:56:52,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:52,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:52,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822104673] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:52,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:56:52,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:56:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210805137] [2022-10-16 10:56:52,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:52,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:56:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:56:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:56:52,257 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:52,469 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-10-16 10:56:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:56:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 10:56:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:52,471 INFO L225 Difference]: With dead ends: 157 [2022-10-16 10:56:52,471 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:56:52,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:56:52,472 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 153 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:52,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 242 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:56:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:56:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 71. [2022-10-16 10:56:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-10-16 10:56:52,483 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2022-10-16 10:56:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:52,484 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-10-16 10:56:52,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-10-16 10:56:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 10:56:52,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:52,485 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] [2022-10-16 10:56:52,523 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:56:52,699 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:56:52,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -780019507, now seen corresponding path program 1 times [2022-10-16 10:56:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:52,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829005644] [2022-10-16 10:56:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:53,534 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:56:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:53,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829005644] [2022-10-16 10:56:53,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829005644] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:53,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992616906] [2022-10-16 10:56:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:53,542 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:56:53,561 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:56:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:53,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 10:56:53,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:53,637 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:56:53,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:56:53,684 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:56:53,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-10-16 10:56:53,970 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:56:53,988 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:56:53,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:54,372 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:56:54,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992616906] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:54,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:56:54,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-10-16 10:56:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736683224] [2022-10-16 10:56:54,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:54,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:56:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:56:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-10-16 10:56:54,375 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:54,677 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-10-16 10:56:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:56:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 10:56:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:54,679 INFO L225 Difference]: With dead ends: 102 [2022-10-16 10:56:54,679 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 10:56:54,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:56:54,681 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:54,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 340 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2022-10-16 10:56:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 10:56:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2022-10-16 10:56:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.28125) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-10-16 10:56:54,695 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 21 [2022-10-16 10:56:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:54,695 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-10-16 10:56:54,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-10-16 10:56:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 10:56:54,700 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:54,700 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:56:54,743 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:56:54,919 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:56:54,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1589199155, now seen corresponding path program 1 times [2022-10-16 10:56:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107921702] [2022-10-16 10:56:54,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:55,549 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:56:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:56:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107921702] [2022-10-16 10:56:55,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107921702] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:56:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945044810] [2022-10-16 10:56:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:55,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:55,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:56:55,552 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:56:55,571 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:56:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:56:55,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:56:55,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:56:55,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:56:55,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:56:55,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:56:55,820 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:56:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:56:55,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:56:59,023 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:56:59,093 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:56:59,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945044810] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:56:59,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:56:59,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-10-16 10:56:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979026463] [2022-10-16 10:56:59,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:56:59,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-16 10:56:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:56:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-16 10:56:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=258, Unknown=1, NotChecked=0, Total=342 [2022-10-16 10:56:59,096 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:56:59,360 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-10-16 10:56:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:56:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 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:56:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:56:59,362 INFO L225 Difference]: With dead ends: 116 [2022-10-16 10:56:59,362 INFO L226 Difference]: Without dead ends: 115 [2022-10-16 10:56:59,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=144, Invalid=407, Unknown=1, NotChecked=0, Total=552 [2022-10-16 10:56:59,363 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 166 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:56:59,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 279 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 164 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-10-16 10:56:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-16 10:56:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2022-10-16 10:56:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-10-16 10:56:59,374 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 22 [2022-10-16 10:56:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:56:59,374 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-10-16 10:56:59,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:56:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-10-16 10:56:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:56:59,376 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:56:59,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:56:59,424 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:56:59,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:56:59,579 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:56:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:56:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1489192897, now seen corresponding path program 2 times [2022-10-16 10:56:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:56:59,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312778828] [2022-10-16 10:56:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:56:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:56:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312778828] [2022-10-16 10:57:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312778828] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021398687] [2022-10-16 10:57:00,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:00,437 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:00,439 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:00,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:00,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:00,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-16 10:57:00,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:00,516 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:00,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:57:00,560 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 23 treesize of output 22 [2022-10-16 10:57:00,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:00,694 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:57:00,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:00,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:00,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 42 [2022-10-16 10:57:01,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-10-16 10:57:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:01,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:02,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021398687] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:02,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:02,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-10-16 10:57:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584595220] [2022-10-16 10:57:02,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:02,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-16 10:57:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-16 10:57:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 10:57:02,222 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 36 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:03,635 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-10-16 10:57:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:57:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 36 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:57:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:03,637 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:57:03,637 INFO L226 Difference]: Without dead ends: 117 [2022-10-16 10:57:03,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=375, Invalid=1977, Unknown=0, NotChecked=0, Total=2352 [2022-10-16 10:57:03,640 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 152 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:03,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 479 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 367 Invalid, 0 Unknown, 347 Unchecked, 0.3s Time] [2022-10-16 10:57:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-16 10:57:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2022-10-16 10:57:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-10-16 10:57:03,651 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 23 [2022-10-16 10:57:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:03,651 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-10-16 10:57:03,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 36 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-10-16 10:57:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:57:03,653 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:03,653 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] [2022-10-16 10:57:03,692 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:03,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:03,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1787966283, now seen corresponding path program 1 times [2022-10-16 10:57:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:03,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240831730] [2022-10-16 10:57:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:03,917 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:03,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:03,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240831730] [2022-10-16 10:57:03,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240831730] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:03,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:03,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:03,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667357340] [2022-10-16 10:57:03,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:03,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:03,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:03,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:03,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:03,919 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call 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:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:03,970 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-10-16 10:57:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:03,972 INFO L225 Difference]: With dead ends: 102 [2022-10-16 10:57:03,972 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 10:57:03,973 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:03,974 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:03,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 10:57:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-10-16 10:57:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.2625) internal successors, (101), 90 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-10-16 10:57:03,985 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2022-10-16 10:57:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:03,985 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-10-16 10:57:03,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call 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:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-10-16 10:57:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:57:03,986 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:03,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:03,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 10:57:03,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1079660375, now seen corresponding path program 1 times [2022-10-16 10:57:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:03,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303036375] [2022-10-16 10:57:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303036375] [2022-10-16 10:57:04,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303036375] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355664721] [2022-10-16 10:57:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:04,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:04,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:04,473 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:04,480 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:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:04,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:57:04,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:04,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:57:04,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:57:04,583 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 23 treesize of output 22 [2022-10-16 10:57:04,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:04,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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:04,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:04,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:04,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 42 [2022-10-16 10:57:05,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-10-16 10:57:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:05,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355664721] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:06,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:06,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-10-16 10:57:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815135473] [2022-10-16 10:57:06,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:57:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:57:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:57:06,558 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:07,712 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-10-16 10:57:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:57:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:57:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:07,714 INFO L225 Difference]: With dead ends: 135 [2022-10-16 10:57:07,714 INFO L226 Difference]: Without dead ends: 134 [2022-10-16 10:57:07,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=377, Invalid=1879, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 10:57:07,716 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 206 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:07,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 824 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 578 Invalid, 0 Unknown, 240 Unchecked, 0.4s Time] [2022-10-16 10:57:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-16 10:57:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 93. [2022-10-16 10:57:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 92 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2022-10-16 10:57:07,727 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 24 [2022-10-16 10:57:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:07,728 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2022-10-16 10:57:07,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-10-16 10:57:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:57:07,729 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:07,729 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:07,768 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:07,944 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:07,945 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:57:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:07,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330373060] [2022-10-16 10:57:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:08,129 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:08,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:08,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330373060] [2022-10-16 10:57:08,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330373060] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:08,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441959577] [2022-10-16 10:57:08,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:08,133 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:08,153 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:08,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:57:08,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:08,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:57:08,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:08,253 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:08,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:08,302 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:08,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441959577] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:08,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:08,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:57:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924379345] [2022-10-16 10:57:08,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:08,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:57:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:08,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:57:08,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:57:08,304 INFO L87 Difference]: Start difference. First operand 93 states and 104 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:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:08,539 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-10-16 10:57:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:08,540 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:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:08,541 INFO L225 Difference]: With dead ends: 109 [2022-10-16 10:57:08,541 INFO L226 Difference]: Without dead ends: 108 [2022-10-16 10:57:08,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:57:08,543 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 164 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:08,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 113 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-16 10:57:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2022-10-16 10:57:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-10-16 10:57:08,554 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 24 [2022-10-16 10:57:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:08,554 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-10-16 10:57:08,554 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:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-10-16 10:57:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:57:08,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:08,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:08,596 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:08,769 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:08,770 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1828467691, now seen corresponding path program 1 times [2022-10-16 10:57:08,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:08,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258466825] [2022-10-16 10:57:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:08,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258466825] [2022-10-16 10:57:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258466825] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606187583] [2022-10-16 10:57:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:08,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:08,838 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:08,872 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:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:08,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:08,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:08,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606187583] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:08,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:08,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:57:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317657003] [2022-10-16 10:57:08,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:08,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:57:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:57:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:57:08,981 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:09,125 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-10-16 10:57:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:09,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:09,126 INFO L225 Difference]: With dead ends: 127 [2022-10-16 10:57:09,127 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:57:09,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 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:09,128 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 96 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:09,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 99 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:57:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2022-10-16 10:57:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 105 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-10-16 10:57:09,140 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 26 [2022-10-16 10:57:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:09,140 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-10-16 10:57:09,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-10-16 10:57:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 10:57:09,142 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:09,142 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] [2022-10-16 10:57:09,183 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:09,354 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:09,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash 880969107, now seen corresponding path program 1 times [2022-10-16 10:57:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:09,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450188843] [2022-10-16 10:57:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:09,465 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:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:09,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450188843] [2022-10-16 10:57:09,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450188843] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:09,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308185512] [2022-10-16 10:57:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:09,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:09,467 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:09,479 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:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:09,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:09,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:09,619 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:09,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:09,691 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:09,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308185512] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:09,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:09,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392181649] [2022-10-16 10:57:09,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:09,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:09,694 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:09,898 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2022-10-16 10:57:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:57:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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 27 [2022-10-16 10:57:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:09,899 INFO L225 Difference]: With dead ends: 159 [2022-10-16 10:57:09,899 INFO L226 Difference]: Without dead ends: 140 [2022-10-16 10:57:09,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 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:09,901 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:09,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 249 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-10-16 10:57:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2022-10-16 10:57:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 113 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2022-10-16 10:57:09,915 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 27 [2022-10-16 10:57:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:09,916 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2022-10-16 10:57:09,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-10-16 10:57:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 10:57:09,917 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:09,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:09,941 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:10,120 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:10,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 847923653, now seen corresponding path program 1 times [2022-10-16 10:57:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:10,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381338199] [2022-10-16 10:57:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:10,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:10,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381338199] [2022-10-16 10:57:10,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381338199] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:10,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73873806] [2022-10-16 10:57:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:10,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:10,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:10,206 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:10,219 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:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:10,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:57:10,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:57:10,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:57:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73873806] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:10,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:57:10,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:57:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304467906] [2022-10-16 10:57:10,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:10,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:57:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:57:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:57:10,306 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:10,380 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-10-16 10:57:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:57:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-16 10:57:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:10,382 INFO L225 Difference]: With dead ends: 123 [2022-10-16 10:57:10,382 INFO L226 Difference]: Without dead ends: 122 [2022-10-16 10:57:10,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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:10,383 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:10,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:57:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-16 10:57:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2022-10-16 10:57:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.25) internal successors, (130), 112 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:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-10-16 10:57:10,396 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 27 [2022-10-16 10:57:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:10,397 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-10-16 10:57:10,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-10-16 10:57:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:57:10,398 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:10,398 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:10,441 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:10,611 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:10,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1189153465, now seen corresponding path program 3 times [2022-10-16 10:57:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:10,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448839436] [2022-10-16 10:57:10,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:10,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:10,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448839436] [2022-10-16 10:57:10,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448839436] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:10,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401753659] [2022-10-16 10:57:10,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:57:10,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:10,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:10,773 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:10,795 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:10,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:57:10,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:10,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:57:10,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:10,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:11,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401753659] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:11,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:11,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:57:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478907022] [2022-10-16 10:57:11,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:57:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:57:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:57:11,109 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:11,495 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2022-10-16 10:57:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 10:57:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 10:57:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:11,497 INFO L225 Difference]: With dead ends: 223 [2022-10-16 10:57:11,497 INFO L226 Difference]: Without dead ends: 178 [2022-10-16 10:57:11,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:57:11,499 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 218 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:11,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 343 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-10-16 10:57:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 127. [2022-10-16 10:57:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 118 states have (on average 1.228813559322034) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-10-16 10:57:11,513 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 29 [2022-10-16 10:57:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:11,513 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-10-16 10:57:11,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-10-16 10:57:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 10:57:11,514 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:11,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:11,555 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:11,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 10:57:11,728 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 497116439, now seen corresponding path program 2 times [2022-10-16 10:57:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:11,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353985883] [2022-10-16 10:57:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:11,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:11,851 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:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:11,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353985883] [2022-10-16 10:57:11,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353985883] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406933605] [2022-10-16 10:57:11,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:11,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:11,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:11,855 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:11,883 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:11,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:11,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:11,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:57:11,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:12,038 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:12,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:12,111 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:12,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406933605] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:12,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:12,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:57:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873982036] [2022-10-16 10:57:12,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:12,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:57:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:57:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:57:12,113 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:12,406 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2022-10-16 10:57:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:57:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-16 10:57:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:12,408 INFO L225 Difference]: With dead ends: 177 [2022-10-16 10:57:12,408 INFO L226 Difference]: Without dead ends: 151 [2022-10-16 10:57:12,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 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:12,410 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 179 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:12,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 319 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:57:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-10-16 10:57:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2022-10-16 10:57:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 115 states have (on average 1.208695652173913) internal successors, (139), 123 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2022-10-16 10:57:12,423 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 31 [2022-10-16 10:57:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:12,424 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2022-10-16 10:57:12,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2022-10-16 10:57:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 10:57:12,425 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:12,425 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] [2022-10-16 10:57:12,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 10:57:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:12,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash -315224233, now seen corresponding path program 2 times [2022-10-16 10:57:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:12,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476079034] [2022-10-16 10:57:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:13,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:13,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476079034] [2022-10-16 10:57:13,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476079034] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:13,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338573924] [2022-10-16 10:57:13,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:57:13,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:13,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:13,782 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:13,805 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:13,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:57:13,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:13,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 10:57:13,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:13,871 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:13,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:57:13,913 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 23 treesize of output 22 [2022-10-16 10:57:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:14,042 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:57:14,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:14,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:14,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 42 [2022-10-16 10:57:14,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:14,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2022-10-16 10:57:14,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2022-10-16 10:57:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:14,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:19,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338573924] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:19,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:19,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 44 [2022-10-16 10:57:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319706774] [2022-10-16 10:57:19,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:19,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 10:57:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:19,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 10:57:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1681, Unknown=1, NotChecked=0, Total=1980 [2022-10-16 10:57:19,896 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call 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,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:21,417 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-10-16 10:57:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:57:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 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 31 [2022-10-16 10:57:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:21,419 INFO L225 Difference]: With dead ends: 135 [2022-10-16 10:57:21,419 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:57:21,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=555, Invalid=2750, Unknown=1, NotChecked=0, Total=3306 [2022-10-16 10:57:21,421 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:21,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 490 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 0 Unknown, 351 Unchecked, 0.5s Time] [2022-10-16 10:57:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:57:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2022-10-16 10:57:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 109 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,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-10-16 10:57:21,434 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 31 [2022-10-16 10:57:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:21,434 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-10-16 10:57:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call 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,435 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-10-16 10:57:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 10:57:21,435 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:21,436 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] [2022-10-16 10:57:21,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-10-16 10:57:21,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:21,651 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -313654027, now seen corresponding path program 1 times [2022-10-16 10:57:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487188925] [2022-10-16 10:57:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:21,711 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:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487188925] [2022-10-16 10:57:21,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487188925] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:57:21,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:57:21,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:57:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664964869] [2022-10-16 10:57:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:57:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:57:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:57:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:57:21,713 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:57:21,786 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2022-10-16 10:57:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:57:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 10:57:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:57:21,787 INFO L225 Difference]: With dead ends: 119 [2022-10-16 10:57:21,788 INFO L226 Difference]: Without dead ends: 117 [2022-10-16 10:57:21,788 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:21,789 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:57:21,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:57:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-16 10:57:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2022-10-16 10:57:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 115 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:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2022-10-16 10:57:21,803 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 32 [2022-10-16 10:57:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:57:21,803 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2022-10-16 10:57:21,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:57:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2022-10-16 10:57:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:57:21,804 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:57:21,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:57:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 10:57:21,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:57:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:57:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash -704379957, now seen corresponding path program 4 times [2022-10-16 10:57:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:57:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245999271] [2022-10-16 10:57:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:57:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:57:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:57:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:57:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245999271] [2022-10-16 10:57:23,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245999271] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:57:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864330092] [2022-10-16 10:57:23,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:57:23,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:57:23,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:57:23,625 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:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:57:23,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:57:23,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:57:23,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-16 10:57:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:57:23,725 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:23,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:23,784 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 23 treesize of output 22 [2022-10-16 10:57:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:23,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:23,997 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 10:57:24,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,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, 4 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 10:57:24,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:24,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:24,668 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 10:57:25,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:57:25,188 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 67 treesize of output 54 [2022-10-16 10:57:25,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:57:25,571 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:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:25,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:57:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:57:33,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864330092] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:57:33,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:57:33,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 56 [2022-10-16 10:57:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35779737] [2022-10-16 10:57:33,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:57:33,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:57:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:57:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:57:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2851, Unknown=1, NotChecked=0, Total=3192 [2022-10-16 10:57:33,782 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 57 states, 56 states have (on average 1.625) internal successors, (91), 57 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:58:24,148 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 212 DAG size of output: 174 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 10:58:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:58:28,859 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2022-10-16 10:58:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-10-16 10:58:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.625) internal successors, (91), 57 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:58:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:58:28,860 INFO L225 Difference]: With dead ends: 177 [2022-10-16 10:58:28,861 INFO L226 Difference]: Without dead ends: 176 [2022-10-16 10:58:28,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=1090, Invalid=8405, Unknown=11, NotChecked=0, Total=9506 [2022-10-16 10:58:28,865 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 207 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:58:28,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 639 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 850 Invalid, 0 Unknown, 830 Unchecked, 0.8s Time] [2022-10-16 10:58:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-10-16 10:58:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2022-10-16 10:58:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 138 states have (on average 1.1884057971014492) internal successors, (164), 146 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:58:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 164 transitions. [2022-10-16 10:58:28,900 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 164 transitions. Word has length 33 [2022-10-16 10:58:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:58:28,900 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 164 transitions. [2022-10-16 10:58:28,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.625) internal successors, (91), 57 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:58:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2022-10-16 10:58:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:58:28,901 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:58:28,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:58:28,942 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:58:29,102 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:58:29,102 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:58:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:58:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -360942113, now seen corresponding path program 2 times [2022-10-16 10:58:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:58:29,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059270209] [2022-10-16 10:58:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:58:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:58:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:58:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:58:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059270209] [2022-10-16 10:58:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059270209] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:58:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472444159] [2022-10-16 10:58:29,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:58:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:58:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:58:29,722 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:58:29,742 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:58:29,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:58:29,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:58:29,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:58:29,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:58:29,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:58:29,869 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:58:30,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:58:30,333 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 23 treesize of output 22 [2022-10-16 10:58:30,561 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 10:58:30,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2022-10-16 10:58:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:58:30,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:31,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:31,417 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 21 treesize of output 25 [2022-10-16 10:58:31,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775809 .cse0))))) is different from false [2022-10-16 10:58:31,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:58:31,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:31,516 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 29 treesize of output 30 [2022-10-16 10:58:31,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:31,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-10-16 10:58:31,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:31,540 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 37 treesize of output 37 [2022-10-16 10:58:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-10-16 10:58:31,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472444159] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:58:31,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:58:31,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 32 [2022-10-16 10:58:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911105027] [2022-10-16 10:58:31,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:58:31,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 10:58:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:58:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 10:58:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=833, Unknown=2, NotChecked=118, Total=1056 [2022-10-16 10:58:31,646 INFO L87 Difference]: Start difference. First operand 147 states and 164 transitions. Second operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 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:58:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:58:32,580 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-10-16 10:58:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:58:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 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 34 [2022-10-16 10:58:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:58:32,582 INFO L225 Difference]: With dead ends: 154 [2022-10-16 10:58:32,582 INFO L226 Difference]: Without dead ends: 153 [2022-10-16 10:58:32,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=1306, Unknown=2, NotChecked=150, Total=1640 [2022-10-16 10:58:32,583 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 81 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:58:32,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 648 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 507 Invalid, 0 Unknown, 367 Unchecked, 0.4s Time] [2022-10-16 10:58:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-16 10:58:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2022-10-16 10:58:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 138 states have (on average 1.181159420289855) internal successors, (163), 146 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:58:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 163 transitions. [2022-10-16 10:58:32,606 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 163 transitions. Word has length 34 [2022-10-16 10:58:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:58:32,606 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 163 transitions. [2022-10-16 10:58:32,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 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:58:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 163 transitions. [2022-10-16 10:58:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 10:58:32,608 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:58:32,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:58:32,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-10-16 10:58:32,813 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:58:32,814 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:58:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:58:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash -841864035, now seen corresponding path program 3 times [2022-10-16 10:58:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:58:32,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660371065] [2022-10-16 10:58:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:58:32,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:58:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:58:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:58:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:58:33,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660371065] [2022-10-16 10:58:33,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660371065] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:58:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889391470] [2022-10-16 10:58:33,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:58:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:58:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:58:33,991 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:58:33,997 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:58:34,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:58:34,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:58:34,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:58:34,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:58:34,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:58:34,110 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:58:34,267 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 10:58:34,267 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:58:34,768 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 46 treesize of output 44 [2022-10-16 10:58:34,954 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:58:34,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2022-10-16 10:58:35,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:58:35,573 INFO L356 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2022-10-16 10:58:35,574 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 3 case distinctions, treesize of input 72 treesize of output 78 [2022-10-16 10:58:36,051 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-10-16 10:58:36,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2022-10-16 10:58:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:58:36,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:58:52,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:52,598 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 62 treesize of output 56 [2022-10-16 10:58:52,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 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_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_104| c_~N~0)))))) is different from false [2022-10-16 10:58:52,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 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_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_104| 1)) (< 9223372036854775807 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1))))) is different from false [2022-10-16 10:58:52,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 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_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_#t~post6#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< 9223372036854775807 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1))))) is different from false [2022-10-16 10:58:52,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 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_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1))))) is different from false [2022-10-16 10:58:53,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_625 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_625)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= v_ArrVal_625 1)) (< |v_ULTIMATE.start_main_~i~0#1_104| 1) (< |v_ULTIMATE.start_main_~i~0#1_110| |v_ULTIMATE.start_main_~i~0#1_104|))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_110| (+ |c_ULTIMATE.start_main_#t~post6#1| 1))))) is different from false [2022-10-16 10:58:53,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_625 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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_625)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= v_ArrVal_625 1)) (< |v_ULTIMATE.start_main_~i~0#1_104| 1) (< |v_ULTIMATE.start_main_~i~0#1_110| |v_ULTIMATE.start_main_~i~0#1_104|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|))))) is different from false [2022-10-16 10:58:53,194 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-10-16 10:58:53,195 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 128 treesize of output 85 [2022-10-16 10:58:53,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 156 [2022-10-16 10:58:53,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:58:53,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:58:53,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:58:53,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:53,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 106 treesize of output 162 [2022-10-16 10:58:53,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:58:53,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:58:53,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:58:53,359 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 129 treesize of output 119 [2022-10-16 10:58:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-10-16 10:58:55,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889391470] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:58:55,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:58:55,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 18] total 45 [2022-10-16 10:58:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522610818] [2022-10-16 10:58:55,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:58:55,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:58:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:58:55,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:58:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1369, Unknown=23, NotChecked=486, Total=2070 [2022-10-16 10:58:55,224 INFO L87 Difference]: Start difference. First operand 147 states and 163 transitions. Second operand has 46 states, 45 states have (on average 2.0) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:58:55,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_625 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_625)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= v_ArrVal_625 1)) (< |v_ULTIMATE.start_main_~i~0#1_104| 1) (< |v_ULTIMATE.start_main_~i~0#1_110| |v_ULTIMATE.start_main_~i~0#1_104|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse4 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:58:57,267 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_#t~post6#1| 0) (= (select .cse0 0) 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_110| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_625 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_625)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= v_ArrVal_625 1)) (< |v_ULTIMATE.start_main_~i~0#1_104| 1) (< |v_ULTIMATE.start_main_~i~0#1_110| |v_ULTIMATE.start_main_~i~0#1_104|))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_110| (+ |c_ULTIMATE.start_main_#t~post6#1| 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse4 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_#t~post6#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< 9223372036854775807 (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1))))))) is different from false [2022-10-16 10:58:57,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse0 8) (= (select .cse1 .cse0) 1) (= (select .cse1 0) 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_104| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_629 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_629))) (+ (select .cse2 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808) (< 9223372036854775807 (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_104| 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 10:59:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:02,360 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2022-10-16 10:59:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-16 10:59:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.0) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-10-16 10:59:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:02,362 INFO L225 Difference]: With dead ends: 185 [2022-10-16 10:59:02,362 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 10:59:02,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=334, Invalid=2322, Unknown=32, NotChecked=972, Total=3660 [2022-10-16 10:59:02,365 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:02,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 473 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 289 Unchecked, 0.1s Time] [2022-10-16 10:59:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 10:59:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2022-10-16 10:59:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 174 states have (on average 1.1781609195402298) internal successors, (205), 182 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call 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:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2022-10-16 10:59:02,394 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 37 [2022-10-16 10:59:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:02,394 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2022-10-16 10:59:02,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.0) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2022-10-16 10:59:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 10:59:02,395 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:02,396 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 10:59:02,425 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:59:02,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:02,611 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:59:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1454520074, now seen corresponding path program 1 times [2022-10-16 10:59:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240297362] [2022-10-16 10:59:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:59:02,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:02,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240297362] [2022-10-16 10:59:02,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240297362] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:02,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604686679] [2022-10-16 10:59:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:02,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:02,687 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:59:02,718 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:59:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:02,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:59:02,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:59:02,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:59:03,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604686679] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:03,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:03,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:59:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800648167] [2022-10-16 10:59:03,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:03,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:59:03,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:59:03,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:59:03,018 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:03,362 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-10-16 10:59:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:59:03,363 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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 38 [2022-10-16 10:59:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:03,364 INFO L225 Difference]: With dead ends: 207 [2022-10-16 10:59:03,364 INFO L226 Difference]: Without dead ends: 175 [2022-10-16 10:59:03,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 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 10:59:03,365 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:03,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 195 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:59:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-10-16 10:59:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-10-16 10:59:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 163 states have (on average 1.1840490797546013) internal successors, (193), 171 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call 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:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2022-10-16 10:59:03,394 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 38 [2022-10-16 10:59:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:03,395 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2022-10-16 10:59:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2022-10-16 10:59:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 10:59:03,396 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:03,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:59:03,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-16 10:59:03,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:03,611 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:59:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -327981213, now seen corresponding path program 1 times [2022-10-16 10:59:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:03,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264325662] [2022-10-16 10:59:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:59:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264325662] [2022-10-16 10:59:04,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264325662] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945467097] [2022-10-16 10:59:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:04,333 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:59:04,355 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:59:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:04,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:59:04,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:04,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:59:04,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:04,645 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:59:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:04,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2022-10-16 10:59:05,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:05,101 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:59:05,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-10-16 10:59:05,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:05,249 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 41 treesize of output 15 [2022-10-16 10:59:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:59:05,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:11,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_695 Int) (v_ArrVal_693 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_695 (+ v_ArrVal_693 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_693)) |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_693 9223372036854775808) 0) (< 0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_695)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (+ 9223372036854775809 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_698)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) is different from false [2022-10-16 10:59:13,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_695 Int) (v_ArrVal_693 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< v_ArrVal_695 (+ v_ArrVal_693 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_693)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (< (+ v_ArrVal_693 9223372036854775808) 0) (< 0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_695)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (+ 9223372036854775809 (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_698)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse1)))))))) is different from false [2022-10-16 10:59:13,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 527 [2022-10-16 10:59:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-10-16 10:59:15,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945467097] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:15,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:15,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 16] total 40 [2022-10-16 10:59:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435743626] [2022-10-16 10:59:15,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:15,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 10:59:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 10:59:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1327, Unknown=3, NotChecked=150, Total=1640 [2022-10-16 10:59:15,626 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:17,552 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2022-10-16 10:59:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:59:17,552 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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 38 [2022-10-16 10:59:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:17,553 INFO L225 Difference]: With dead ends: 234 [2022-10-16 10:59:17,553 INFO L226 Difference]: Without dead ends: 233 [2022-10-16 10:59:17,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=487, Invalid=2940, Unknown=3, NotChecked=230, Total=3660 [2022-10-16 10:59:17,556 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 323 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:17,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 618 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 594 Invalid, 0 Unknown, 442 Unchecked, 0.6s Time] [2022-10-16 10:59:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-16 10:59:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 177. [2022-10-16 10:59:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 176 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call 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,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2022-10-16 10:59:17,586 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 200 transitions. Word has length 38 [2022-10-16 10:59:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:17,587 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 200 transitions. [2022-10-16 10:59:17,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,587 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 200 transitions. [2022-10-16 10:59:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 10:59:17,588 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:17,588 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:59:17,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 10:59:17,801 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,SelfDestructingSolverStorable25 [2022-10-16 10:59:17,801 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:59:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:17,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1793130961, now seen corresponding path program 5 times [2022-10-16 10:59:17,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:17,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327296230] [2022-10-16 10:59:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:59:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327296230] [2022-10-16 10:59:18,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327296230] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177232094] [2022-10-16 10:59:18,076 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:59:18,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:18,079 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:18,102 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:18,185 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:59:18,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:59:18,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:59:18,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:59:18,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:59:18,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177232094] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:18,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:18,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:59:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586199963] [2022-10-16 10:59:18,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:18,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:59:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:18,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:59:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:59:18,750 INFO L87 Difference]: Start difference. First operand 177 states and 200 transitions. Second operand has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:19,404 INFO L93 Difference]: Finished difference Result 278 states and 311 transitions. [2022-10-16 10:59:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:59:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 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 39 [2022-10-16 10:59:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:19,406 INFO L225 Difference]: With dead ends: 278 [2022-10-16 10:59:19,406 INFO L226 Difference]: Without dead ends: 225 [2022-10-16 10:59:19,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:59:19,407 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 208 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:19,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 420 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:59:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-10-16 10:59:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 183. [2022-10-16 10:59:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 182 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call 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,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 206 transitions. [2022-10-16 10:59:19,446 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 206 transitions. Word has length 39 [2022-10-16 10:59:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:19,446 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 206 transitions. [2022-10-16 10:59:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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,446 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 206 transitions. [2022-10-16 10:59:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 10:59:19,447 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:19,447 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] [2022-10-16 10:59:19,474 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:19,654 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,SelfDestructingSolverStorable26 [2022-10-16 10:59:19,654 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:59:19,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1657329947, now seen corresponding path program 1 times [2022-10-16 10:59:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:19,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844734822] [2022-10-16 10:59:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 10:59:19,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:19,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844734822] [2022-10-16 10:59:19,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844734822] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:19,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790282563] [2022-10-16 10:59:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:19,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:19,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:19,726 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:19,737 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:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:19,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:59:19,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 10:59:19,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 10:59:19,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790282563] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:59:19,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:59:19,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:59:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414754624] [2022-10-16 10:59:19,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:59:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:59:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:59:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:59:19,899 INFO L87 Difference]: Start difference. First operand 183 states and 206 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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:59:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:20,125 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2022-10-16 10:59:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:59:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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 40 [2022-10-16 10:59:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:20,127 INFO L225 Difference]: With dead ends: 211 [2022-10-16 10:59:20,128 INFO L226 Difference]: Without dead ends: 210 [2022-10-16 10:59:20,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 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:59:20,129 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:20,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 143 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:59:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-10-16 10:59:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2022-10-16 10:59:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 188 states have (on average 1.2074468085106382) internal successors, (227), 196 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call 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:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 227 transitions. [2022-10-16 10:59:20,161 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 227 transitions. Word has length 40 [2022-10-16 10:59:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:20,162 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 227 transitions. [2022-10-16 10:59:20,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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:59:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 227 transitions. [2022-10-16 10:59:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:59:20,163 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:20,163 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] [2022-10-16 10:59:20,201 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:20,376 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,SelfDestructingSolverStorable27 [2022-10-16 10:59:20,377 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:59:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 162379297, now seen corresponding path program 1 times [2022-10-16 10:59:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:20,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114053233] [2022-10-16 10:59:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 10:59:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:20,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114053233] [2022-10-16 10:59:20,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114053233] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:20,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014907242] [2022-10-16 10:59:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:20,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:20,459 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:20,475 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:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:20,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:59:20,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 10:59:20,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:59:20,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014907242] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:59:20,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:59:20,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:59:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560634499] [2022-10-16 10:59:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:59:20,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:59:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:59:20,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:59:20,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:59:20,584 INFO L87 Difference]: Start difference. First operand 197 states and 227 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:59:20,726 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2022-10-16 10:59:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:59:20,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:59:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:59:20,728 INFO L225 Difference]: With dead ends: 198 [2022-10-16 10:59:20,728 INFO L226 Difference]: Without dead ends: 197 [2022-10-16 10:59:20,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:59:20,737 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:59:20,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:59:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-10-16 10:59:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2022-10-16 10:59:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 188 states have (on average 1.1861702127659575) internal successors, (223), 195 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call 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:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2022-10-16 10:59:20,780 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 41 [2022-10-16 10:59:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:59:20,780 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2022-10-16 10:59:20,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:59:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2022-10-16 10:59:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:59:20,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:59:20,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:59:20,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 10:59:20,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:20,995 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-10-16 10:59:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:59:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 916922721, now seen corresponding path program 3 times [2022-10-16 10:59:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:59:20,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805274034] [2022-10-16 10:59:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:59:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:59:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:59:23,014 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:59:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:59:23,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805274034] [2022-10-16 10:59:23,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805274034] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:59:23,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612930] [2022-10-16 10:59:23,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:59:23,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:59:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:59:23,017 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:59:23,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 10:59:23,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 10:59:23,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:59:23,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 62 conjunts are in the unsatisfiable core [2022-10-16 10:59:23,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:59:23,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:59:23,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:59:23,182 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 23 treesize of output 22 [2022-10-16 10:59:23,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:23,371 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:59:23,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:23,503 INFO L356 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2022-10-16 10:59:23,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2022-10-16 10:59:24,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:59:24,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:24,226 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-10-16 10:59:24,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 56 [2022-10-16 10:59:24,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:24,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:24,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:59:24,756 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-10-16 10:59:24,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 54 [2022-10-16 10:59:25,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:25,425 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:59:25,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 65 [2022-10-16 10:59:30,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:30,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:30,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:59:30,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:59:30,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 58 treesize of output 22 [2022-10-16 10:59:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:59:31,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:59:45,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_864 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_142|) (< |v_ULTIMATE.start_main_~i~0#1_142| |ULTIMATE.start_main_~i~0#1|) (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_864 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863)))))) is different from false [2022-10-16 10:59:47,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse0 (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_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_861) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_864 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863)))))) is different from false [2022-10-16 10:59:49,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post6#1| 8) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< (+ v_ArrVal_861 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863) (< (+ v_ArrVal_864 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_863 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864)))))) is different from false [2022-10-16 10:59:52,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse2 (store (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_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_861 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863) (< (+ v_ArrVal_864 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_863 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864)))))) is different from false [2022-10-16 11:00:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-10-16 11:00:27,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612930] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:00:27,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:00:27,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 26] total 73 [2022-10-16 11:00:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682296458] [2022-10-16 11:00:27,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:00:27,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-10-16 11:00:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:00:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-10-16 11:00:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=4204, Unknown=21, NotChecked=556, Total=5402 [2022-10-16 11:00:27,702 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 74 states, 73 states have (on average 1.5753424657534247) internal successors, (115), 74 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:00:29,745 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_~i~0#1|))) (and (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse4 (store (store .cse0 (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_861 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863) (< (+ v_ArrVal_864 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_863 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) is different from false [2022-10-16 11:00:31,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= .cse0 8) (= (select .cse1 0) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse2 (store (store .cse1 .cse0 v_ArrVal_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_861) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_864 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 11:00:33,284 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse0 8) (= (select .cse1 .cse0) 1) (= (select .cse1 0) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) (forall ((v_ArrVal_863 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_864 Int)) (let ((.cse3 (store .cse1 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_142|) (< |v_ULTIMATE.start_main_~i~0#1_142| |ULTIMATE.start_main_~i~0#1|) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_864 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 11:00:34,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (<= |c_ULTIMATE.start_main_#t~post6#1| 1) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) 1) |c_ULTIMATE.start_main_#t~post6#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) (forall ((v_ArrVal_863 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_864 Int)) (let ((.cse2 (store .cse0 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_142|) (< |v_ULTIMATE.start_main_~i~0#1_142| |ULTIMATE.start_main_~i~0#1|) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_864 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863)))))))) is different from false [2022-10-16 11:00:36,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (= (select .cse0 8) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) (forall ((v_ArrVal_863 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_864 Int)) (let ((.cse2 (store .cse0 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_142|) (< |v_ULTIMATE.start_main_~i~0#1_142| |ULTIMATE.start_main_~i~0#1|) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_864 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_863)))))))) is different from false [2022-10-16 11:00:39,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (and (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (<= (select .cse0 .cse2) 1) (= (select .cse0 |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) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse5 (store (store .cse0 (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_861 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) v_ArrVal_863) (< (+ v_ArrVal_864 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< (+ v_ArrVal_863 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-10-16 11:00:41,733 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (select .cse0 .cse1) 1) (= (select .cse0 |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) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse4 (store (store .cse0 (+ (* |c_ULTIMATE.start_main_#t~post6#1| 8) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< (+ v_ArrVal_861 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_863) (< (+ v_ArrVal_864 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_861) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_863 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864)))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= |c_ULTIMATE.start_main_#t~post6#1| |ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (< |ULTIMATE.start_main_~i~0#1| c_~N~0))))) is different from false [2022-10-16 11:00:43,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (and (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_138| 1)) (< |v_ULTIMATE.start_main_~i~0#1_138| c_~N~0) (= (select .cse0 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_138|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (select .cse0 .cse1) 1) (= (select .cse0 |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) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_856 Int) (v_ArrVal_864 Int)) (let ((.cse2 (store (store .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_856) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_142| 2) (< (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_861) (< |v_ULTIMATE.start_main_~i~0#1_142| |v_ULTIMATE.start_main_~i~0#1_147|) (< |v_ULTIMATE.start_main_~i~0#1_147| |v_ULTIMATE.start_main_~i~0#1_142|) (not (<= v_ArrVal_856 1)) (< (+ v_ArrVal_864 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_864)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 9223372036854775808) (< (+ v_ArrVal_863 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_863)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_864) (< (+ v_ArrVal_861 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_861)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_863)))))))) is different from false