/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sum_natnum.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:26:27,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:26:27,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:26:27,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:26:27,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:26:27,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:26:27,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:26:27,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:26:27,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:26:27,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:26:27,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:26:27,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:26:27,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:26:27,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:26:27,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:26:27,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:26:27,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:26:27,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:26:27,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:26:27,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:26:27,254 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:26:27,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:26:27,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:26:27,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:26:27,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:26:27,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:26:27,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:26:27,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:26:27,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:26:27,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:26:27,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:26:27,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:26:27,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:26:27,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:26:27,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:26:27,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:26:27,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:26:27,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:26:27,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:26:27,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:26:27,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:26:27,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:26:27,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:26:27,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:26:27,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:26:27,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:26:27,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:26:27,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:26:27,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:26:27,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:26:27,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:26:27,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:26:27,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:26:27,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:26:27,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:26:27,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:26:27,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:26:27,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:26:27,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:26:27,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:26:27,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:26:27,286 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:26:27,286 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:26:27,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:26:27,286 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:26:27,287 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:26:27,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:26:27,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:26:27,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:26:27,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:26:27,504 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:26:27,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-28 10:26:27,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f1fefe2/0af29169753642829ef7e5068ff5c83b/FLAG312bb5e75 [2022-04-28 10:26:27,899 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:26:27,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-28 10:26:27,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f1fefe2/0af29169753642829ef7e5068ff5c83b/FLAG312bb5e75 [2022-04-28 10:26:28,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f1fefe2/0af29169753642829ef7e5068ff5c83b [2022-04-28 10:26:28,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:26:28,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:26:28,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:26:28,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:26:28,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:26:28,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cab77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28, skipping insertion in model container [2022-04-28 10:26:28,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:26:28,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:26:28,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c[458,471] [2022-04-28 10:26:28,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:26:28,525 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:26:28,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c[458,471] [2022-04-28 10:26:28,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:26:28,566 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:26:28,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28 WrapperNode [2022-04-28 10:26:28,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:26:28,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:26:28,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:26:28,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:26:28,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:26:28,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:26:28,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:26:28,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:26:28,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (1/1) ... [2022-04-28 10:26:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:26:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:28,649 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-04-28 10:26:28,672 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-04-28 10:26:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:26:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:26:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:26:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:26:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:26:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:26:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:26:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:26:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:26:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:26:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:26:28,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:26:28,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:26:28,748 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:26:28,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:26:28,872 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:26:28,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:26:28,887 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:26:28,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:26:28 BoogieIcfgContainer [2022-04-28 10:26:28,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:26:28,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:26:28,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:26:28,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:26:28,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:26:28" (1/3) ... [2022-04-28 10:26:28,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405d28d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:26:28, skipping insertion in model container [2022-04-28 10:26:28,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:26:28" (2/3) ... [2022-04-28 10:26:28,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405d28d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:26:28, skipping insertion in model container [2022-04-28 10:26:28,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:26:28" (3/3) ... [2022-04-28 10:26:28,905 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_natnum.c [2022-04-28 10:26:28,917 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:26:28,917 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:26:28,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:26:28,961 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bd818cf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44816bc7 [2022-04-28 10:26:28,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:26:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:26:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:26:28,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:28,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:28,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 1 times [2022-04-28 10:26:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:29,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [940692235] [2022-04-28 10:26:29,010 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:26:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 2 times [2022-04-28 10:26:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:29,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288642256] [2022-04-28 10:26:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:29,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:29,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965523241] [2022-04-28 10:26:29,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:26:29,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:29,093 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-04-28 10:26:29,096 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-04-28 10:26:29,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:26:29,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:29,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 10:26:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:29,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:29,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2022-04-28 10:26:29,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:29,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(<= 40000 ~SIZE~0)} assume true; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:29,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#(<= 40000 ~SIZE~0)} {22#true} #45#return; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:29,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:29,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:29,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {23#false} is VALID [2022-04-28 10:26:29,352 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {23#false} is VALID [2022-04-28 10:26:29,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 10:26:29,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 10:26:29,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 10:26:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:29,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:26:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:29,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288642256] [2022-04-28 10:26:29,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965523241] [2022-04-28 10:26:29,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965523241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:29,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:29,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:26:29,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:29,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [940692235] [2022-04-28 10:26:29,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [940692235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:29,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:29,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:26:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148777036] [2022-04-28 10:26:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:26:29,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:29,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:29,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:29,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:26:29,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:29,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:26:29,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:26:29,432 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:35,571 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 10:26:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:26:35,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:26:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:26:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:26:35,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 10:26:35,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:35,641 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:26:35,641 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 10:26:35,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-04-28 10:26:35,649 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:35,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:26:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 10:26:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 10:26:35,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:35,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,693 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,693 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:35,700 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 10:26:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 10:26:35,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:35,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:35,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 10:26:35,702 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 10:26:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:35,705 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 10:26:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 10:26:35,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:35,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:35,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:35,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 10:26:35,713 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 10:26:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:35,720 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 10:26:35,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:35,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 10:26:35,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 10:26:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:26:35,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:35,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:35,760 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-04-28 10:26:35,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 10:26:35,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash 284139538, now seen corresponding path program 1 times [2022-04-28 10:26:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:35,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165366620] [2022-04-28 10:26:35,978 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:35,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash 284139538, now seen corresponding path program 2 times [2022-04-28 10:26:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:35,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719137806] [2022-04-28 10:26:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:35,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:35,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:35,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38644407] [2022-04-28 10:26:35,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:26:35,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:35,994 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-04-28 10:26:36,022 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-04-28 10:26:36,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:26:36,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:36,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:26:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:36,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:36,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2022-04-28 10:26:36,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:36,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#(<= 40000 ~SIZE~0)} assume true; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:36,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#(<= 40000 ~SIZE~0)} {174#true} #45#return; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:36,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:36,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:36,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:36,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {175#false} is VALID [2022-04-28 10:26:36,193 INFO L272 TraceCheckUtils]: 8: Hoare triple {175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {175#false} is VALID [2022-04-28 10:26:36,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2022-04-28 10:26:36,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2022-04-28 10:26:36,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-28 10:26:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:36,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:36,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-28 10:26:36,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2022-04-28 10:26:36,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2022-04-28 10:26:36,327 INFO L272 TraceCheckUtils]: 8: Hoare triple {175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {175#false} is VALID [2022-04-28 10:26:36,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {175#false} is VALID [2022-04-28 10:26:36,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {227#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:26:36,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(< 1 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {231#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:26:36,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(< 1 ~SIZE~0)} call #t~ret4 := main(); {235#(< 1 ~SIZE~0)} is VALID [2022-04-28 10:26:36,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(< 1 ~SIZE~0)} {174#true} #45#return; {235#(< 1 ~SIZE~0)} is VALID [2022-04-28 10:26:36,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(< 1 ~SIZE~0)} assume true; {235#(< 1 ~SIZE~0)} is VALID [2022-04-28 10:26:36,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {235#(< 1 ~SIZE~0)} is VALID [2022-04-28 10:26:36,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2022-04-28 10:26:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719137806] [2022-04-28 10:26:36,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38644407] [2022-04-28 10:26:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38644407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:36,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:26:36,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 10:26:36,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165366620] [2022-04-28 10:26:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165366620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:36,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:36,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:26:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410691966] [2022-04-28 10:26:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:36,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:26:36,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:36,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:36,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:36,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:26:36,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:26:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:26:36,349 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:40,476 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:26:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:26:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:26:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 10:26:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 10:26:40,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 10:26:40,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:40,502 INFO L225 Difference]: With dead ends: 19 [2022-04-28 10:26:40,502 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 10:26:40,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:26:40,505 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:40,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:26:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 10:26:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 10:26:40,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:40,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,521 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,521 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:40,523 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:26:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:26:40,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:40,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:40,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 10:26:40,524 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 10:26:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:40,526 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:26:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:26:40,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:40,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:40,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:40,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 10:26:40,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 10:26:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:40,533 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 10:26:40,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:40,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 10:26:40,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:26:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:26:40,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:40,547 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:40,574 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-04-28 10:26:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 10:26:40,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 252886155, now seen corresponding path program 3 times [2022-04-28 10:26:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:40,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688290367] [2022-04-28 10:26:40,763 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:40,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash 252886155, now seen corresponding path program 4 times [2022-04-28 10:26:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:40,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845364870] [2022-04-28 10:26:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:40,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:40,779 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:40,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689277895] [2022-04-28 10:26:40,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:26:40,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:40,780 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-04-28 10:26:40,785 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-04-28 10:26:40,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:26:40,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:40,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:26:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:40,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:40,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-28 10:26:40,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:40,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(<= 40000 ~SIZE~0)} assume true; {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:40,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#(<= 40000 ~SIZE~0)} {347#true} #45#return; {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:40,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:40,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {368#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:40,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {372#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:40,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:26:40,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !(~i~0 < ~SIZE~0); {348#false} is VALID [2022-04-28 10:26:40,965 INFO L272 TraceCheckUtils]: 9: Hoare triple {348#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {348#false} is VALID [2022-04-28 10:26:40,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-04-28 10:26:40,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-04-28 10:26:40,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-28 10:26:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:40,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:41,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-28 10:26:41,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-04-28 10:26:41,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-04-28 10:26:41,085 INFO L272 TraceCheckUtils]: 9: Hoare triple {348#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {348#false} is VALID [2022-04-28 10:26:41,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {348#false} is VALID [2022-04-28 10:26:41,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {404#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:26:41,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {408#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:26:41,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#(< 2 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {412#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:26:41,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#(< 2 ~SIZE~0)} call #t~ret4 := main(); {416#(< 2 ~SIZE~0)} is VALID [2022-04-28 10:26:41,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#(< 2 ~SIZE~0)} {347#true} #45#return; {416#(< 2 ~SIZE~0)} is VALID [2022-04-28 10:26:41,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#(< 2 ~SIZE~0)} assume true; {416#(< 2 ~SIZE~0)} is VALID [2022-04-28 10:26:41,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {416#(< 2 ~SIZE~0)} is VALID [2022-04-28 10:26:41,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-28 10:26:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845364870] [2022-04-28 10:26:41,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689277895] [2022-04-28 10:26:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689277895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:41,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:26:41,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 10:26:41,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688290367] [2022-04-28 10:26:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688290367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:41,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:41,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:26:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633373640] [2022-04-28 10:26:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:26:41,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:41,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:41,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:41,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:26:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:26:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:26:41,108 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:45,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:26:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:47,172 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:26:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:26:47,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:26:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 10:26:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 10:26:47,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 10:26:47,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:47,200 INFO L225 Difference]: With dead ends: 20 [2022-04-28 10:26:47,200 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:26:47,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:26:47,202 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:47,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:26:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:26:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:26:47,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:47,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,214 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,214 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:47,215 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:26:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:26:47,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:47,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:47,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:26:47,216 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:26:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:47,217 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:26:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:26:47,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:47,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:47,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:47,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 10:26:47,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 10:26:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:47,219 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 10:26:47,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 10:26:47,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:26:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:26:47,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:47,234 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:47,250 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-04-28 10:26:47,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:47,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash -715968718, now seen corresponding path program 5 times [2022-04-28 10:26:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:47,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1638585610] [2022-04-28 10:26:47,439 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:47,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -715968718, now seen corresponding path program 6 times [2022-04-28 10:26:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:47,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121922575] [2022-04-28 10:26:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:47,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:47,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591279370] [2022-04-28 10:26:47,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:26:47,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:47,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:47,457 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-04-28 10:26:47,487 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-04-28 10:26:47,515 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:26:47,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:47,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:26:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:47,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:47,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-28 10:26:47,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:47,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#(<= 40000 ~SIZE~0)} assume true; {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:47,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#(<= 40000 ~SIZE~0)} {534#true} #45#return; {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:47,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:47,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:47,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:47,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:26:47,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:26:47,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !(~i~0 < ~SIZE~0); {535#false} is VALID [2022-04-28 10:26:47,654 INFO L272 TraceCheckUtils]: 10: Hoare triple {535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {535#false} is VALID [2022-04-28 10:26:47,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 10:26:47,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 10:26:47,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 10:26:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:47,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:47,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 10:26:47,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 10:26:47,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 10:26:47,810 INFO L272 TraceCheckUtils]: 10: Hoare triple {535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {535#false} is VALID [2022-04-28 10:26:47,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {535#false} is VALID [2022-04-28 10:26:47,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {595#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:26:47,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {599#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:26:47,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {603#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:26:47,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#(< 3 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {607#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:26:47,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {611#(< 3 ~SIZE~0)} call #t~ret4 := main(); {611#(< 3 ~SIZE~0)} is VALID [2022-04-28 10:26:47,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {611#(< 3 ~SIZE~0)} {534#true} #45#return; {611#(< 3 ~SIZE~0)} is VALID [2022-04-28 10:26:47,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {611#(< 3 ~SIZE~0)} assume true; {611#(< 3 ~SIZE~0)} is VALID [2022-04-28 10:26:47,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {611#(< 3 ~SIZE~0)} is VALID [2022-04-28 10:26:47,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-28 10:26:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121922575] [2022-04-28 10:26:47,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591279370] [2022-04-28 10:26:47,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591279370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:47,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:26:47,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 10:26:47,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:47,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1638585610] [2022-04-28 10:26:47,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1638585610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:47,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:47,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:26:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234150762] [2022-04-28 10:26:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:26:47,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:47,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:47,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:26:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:47,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:26:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:26:47,831 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:48,356 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:26:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:26:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:26:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 10:26:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 10:26:48,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 10:26:48,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:48,377 INFO L225 Difference]: With dead ends: 21 [2022-04-28 10:26:48,378 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:26:48,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:26:48,379 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:48,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:26:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:26:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 10:26:48,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:48,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,391 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,391 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:48,392 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:26:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:26:48,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:48,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:48,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:26:48,392 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:26:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:48,393 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:26:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:26:48,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:48,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:48,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:48,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 10:26:48,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 10:26:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:48,395 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 10:26:48,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:48,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 10:26:48,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:26:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:26:48,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:48,409 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:48,425 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-04-28 10:26:48,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:48,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:48,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -685698709, now seen corresponding path program 7 times [2022-04-28 10:26:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:48,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1862617659] [2022-04-28 10:26:48,620 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:48,620 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash -685698709, now seen corresponding path program 8 times [2022-04-28 10:26:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:48,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010036226] [2022-04-28 10:26:48,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:48,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226700035] [2022-04-28 10:26:48,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:26:48,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:48,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:48,680 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-04-28 10:26:48,681 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-04-28 10:26:48,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:26:48,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:48,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:26:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:48,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:48,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2022-04-28 10:26:48,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:48,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#(<= 40000 ~SIZE~0)} assume true; {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:48,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#(<= 40000 ~SIZE~0)} {735#true} #45#return; {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:48,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:48,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {756#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:48,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {756#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {760#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:48,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:26:48,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:26:48,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {772#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:26:48,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !(~i~0 < ~SIZE~0); {736#false} is VALID [2022-04-28 10:26:48,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {736#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {736#false} is VALID [2022-04-28 10:26:48,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2022-04-28 10:26:48,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2022-04-28 10:26:48,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-28 10:26:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:48,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:49,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-28 10:26:49,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2022-04-28 10:26:49,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2022-04-28 10:26:49,082 INFO L272 TraceCheckUtils]: 11: Hoare triple {736#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {736#false} is VALID [2022-04-28 10:26:49,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {736#false} is VALID [2022-04-28 10:26:49,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {800#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:26:49,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {804#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:26:49,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {808#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:26:49,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {812#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:26:49,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {820#(< 4 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {816#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:26:49,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {820#(< 4 ~SIZE~0)} call #t~ret4 := main(); {820#(< 4 ~SIZE~0)} is VALID [2022-04-28 10:26:49,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {820#(< 4 ~SIZE~0)} {735#true} #45#return; {820#(< 4 ~SIZE~0)} is VALID [2022-04-28 10:26:49,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {820#(< 4 ~SIZE~0)} assume true; {820#(< 4 ~SIZE~0)} is VALID [2022-04-28 10:26:49,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {820#(< 4 ~SIZE~0)} is VALID [2022-04-28 10:26:49,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2022-04-28 10:26:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010036226] [2022-04-28 10:26:49,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226700035] [2022-04-28 10:26:49,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226700035] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:49,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:26:49,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 10:26:49,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1862617659] [2022-04-28 10:26:49,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1862617659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:49,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:49,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:26:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985310528] [2022-04-28 10:26:49,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:49,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:26:49,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:49,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:49,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:49,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:26:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:49,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:26:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:26:49,109 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:53,185 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:26:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:26:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:26:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 10:26:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 10:26:53,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 10:26:53,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:53,208 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:26:53,209 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:26:53,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:26:53,210 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:53,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:26:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:26:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:26:53,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:53,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,224 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,224 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:53,225 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:26:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:26:53,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:53,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:53,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:26:53,226 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:26:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:53,227 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:26:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:26:53,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:53,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:53,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:53,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 10:26:53,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 10:26:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:53,231 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 10:26:53,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 10:26:53,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:26:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:26:53,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:53,248 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:53,275 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-04-28 10:26:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:53,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:53,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 252671570, now seen corresponding path program 9 times [2022-04-28 10:26:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:53,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648863710] [2022-04-28 10:26:53,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:53,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 252671570, now seen corresponding path program 10 times [2022-04-28 10:26:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:53,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312510427] [2022-04-28 10:26:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:53,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:53,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206721523] [2022-04-28 10:26:53,467 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:26:53,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:53,469 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-04-28 10:26:53,493 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-04-28 10:26:53,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:26:53,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:53,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:26:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:53,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:53,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {950#true} call ULTIMATE.init(); {950#true} is VALID [2022-04-28 10:26:53,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:53,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {958#(<= 40000 ~SIZE~0)} assume true; {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:53,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {958#(<= 40000 ~SIZE~0)} {950#true} #45#return; {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:53,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {958#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:53,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {958#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:53,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:53,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:26:53,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:26:53,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:26:53,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:53,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {951#false} is VALID [2022-04-28 10:26:53,743 INFO L272 TraceCheckUtils]: 12: Hoare triple {951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {951#false} is VALID [2022-04-28 10:26:53,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#false} ~cond := #in~cond; {951#false} is VALID [2022-04-28 10:26:53,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#false} assume 0 == ~cond; {951#false} is VALID [2022-04-28 10:26:53,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#false} assume !false; {951#false} is VALID [2022-04-28 10:26:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:53,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:53,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#false} assume !false; {951#false} is VALID [2022-04-28 10:26:53,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#false} assume 0 == ~cond; {951#false} is VALID [2022-04-28 10:26:53,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#false} ~cond := #in~cond; {951#false} is VALID [2022-04-28 10:26:53,939 INFO L272 TraceCheckUtils]: 12: Hoare triple {951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {951#false} is VALID [2022-04-28 10:26:53,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {951#false} is VALID [2022-04-28 10:26:53,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {1023#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1019#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:26:53,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1023#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:26:53,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {1031#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1027#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:26:53,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1035#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1031#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:26:53,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {1039#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1035#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:26:53,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {1043#(< 5 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1039#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:26:53,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {1043#(< 5 ~SIZE~0)} call #t~ret4 := main(); {1043#(< 5 ~SIZE~0)} is VALID [2022-04-28 10:26:53,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1043#(< 5 ~SIZE~0)} {950#true} #45#return; {1043#(< 5 ~SIZE~0)} is VALID [2022-04-28 10:26:53,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1043#(< 5 ~SIZE~0)} assume true; {1043#(< 5 ~SIZE~0)} is VALID [2022-04-28 10:26:53,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1043#(< 5 ~SIZE~0)} is VALID [2022-04-28 10:26:53,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {950#true} call ULTIMATE.init(); {950#true} is VALID [2022-04-28 10:26:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:53,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312510427] [2022-04-28 10:26:53,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:53,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206721523] [2022-04-28 10:26:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206721523] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:53,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:26:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 10:26:53,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648863710] [2022-04-28 10:26:53,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648863710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:53,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:53,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:26:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949966704] [2022-04-28 10:26:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:26:53,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:53,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:53,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:53,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:26:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:26:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:26:53,968 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:56,166 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:26:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:26:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:26:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 10:26:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 10:26:56,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 10:26:56,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:56,189 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:26:56,189 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:26:56,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:26:56,190 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:56,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:26:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:26:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:26:56,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:56,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,205 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,205 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:56,206 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:26:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:26:56,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:56,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:56,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:26:56,207 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:26:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:56,208 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:26:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:26:56,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:56,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:56,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:56,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 10:26:56,209 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 10:26:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:56,209 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 10:26:56,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 10:26:56,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:26:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:26:56,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:56,227 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:56,243 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-04-28 10:26:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:56,430 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash -722620853, now seen corresponding path program 11 times [2022-04-28 10:26:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:56,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1218261951] [2022-04-28 10:26:56,433 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:56,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -722620853, now seen corresponding path program 12 times [2022-04-28 10:26:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:56,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561162400] [2022-04-28 10:26:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:56,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:26:56,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771580816] [2022-04-28 10:26:56,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:26:56,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:56,457 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-04-28 10:26:56,492 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-04-28 10:26:56,509 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:26:56,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:26:56,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:26:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:56,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:26:56,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-28 10:26:56,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:56,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#(<= 40000 ~SIZE~0)} assume true; {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:56,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#(<= 40000 ~SIZE~0)} {1179#true} #45#return; {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:56,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:26:56,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1200#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:56,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1204#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:56,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {1204#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1208#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:26:56,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1208#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1212#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:26:56,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1216#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:26:56,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1220#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:26:56,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {1220#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1224#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:26:56,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !(~i~0 < ~SIZE~0); {1180#false} is VALID [2022-04-28 10:26:56,745 INFO L272 TraceCheckUtils]: 13: Hoare triple {1180#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1180#false} is VALID [2022-04-28 10:26:56,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {1180#false} ~cond := #in~cond; {1180#false} is VALID [2022-04-28 10:26:56,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#false} assume 0 == ~cond; {1180#false} is VALID [2022-04-28 10:26:56,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-28 10:26:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:56,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:56,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-28 10:26:56,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#false} assume 0 == ~cond; {1180#false} is VALID [2022-04-28 10:26:56,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {1180#false} ~cond := #in~cond; {1180#false} is VALID [2022-04-28 10:26:56,971 INFO L272 TraceCheckUtils]: 13: Hoare triple {1180#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1180#false} is VALID [2022-04-28 10:26:56,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1180#false} is VALID [2022-04-28 10:26:56,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {1256#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1252#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:26:56,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1256#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:26:56,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1260#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:26:56,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1264#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:26:56,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1268#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:26:56,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1272#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:26:56,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#(< 6 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1276#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:26:56,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1280#(< 6 ~SIZE~0)} call #t~ret4 := main(); {1280#(< 6 ~SIZE~0)} is VALID [2022-04-28 10:26:56,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1280#(< 6 ~SIZE~0)} {1179#true} #45#return; {1280#(< 6 ~SIZE~0)} is VALID [2022-04-28 10:26:56,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#(< 6 ~SIZE~0)} assume true; {1280#(< 6 ~SIZE~0)} is VALID [2022-04-28 10:26:56,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1280#(< 6 ~SIZE~0)} is VALID [2022-04-28 10:26:56,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-28 10:26:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:56,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561162400] [2022-04-28 10:26:56,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:26:56,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771580816] [2022-04-28 10:26:56,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771580816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:56,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:26:56,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 10:26:56,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:56,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1218261951] [2022-04-28 10:26:56,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1218261951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:56,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:56,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:26:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137210084] [2022-04-28 10:26:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:56,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:26:56,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:56,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:56,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:26:56,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:26:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:26:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:26:56,997 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:01,070 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:27:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:27:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:27:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 10:27:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 10:27:01,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 10:27:01,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:01,092 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:27:01,092 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:27:01,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:27:01,093 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:01,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:27:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:27:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:27:01,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:01,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,110 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,110 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:01,111 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:27:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:27:01,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:01,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:01,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:27:01,112 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:27:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:01,112 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:27:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:27:01,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:01,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:01,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:01,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 10:27:01,114 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-28 10:27:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:01,114 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 10:27:01,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 10:27:01,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:27:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:27:01,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:01,130 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:01,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 10:27:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:01,331 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -891914894, now seen corresponding path program 13 times [2022-04-28 10:27:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:01,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059240772] [2022-04-28 10:27:01,343 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:01,343 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash -891914894, now seen corresponding path program 14 times [2022-04-28 10:27:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:01,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926456649] [2022-04-28 10:27:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:01,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:01,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887153278] [2022-04-28 10:27:01,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:27:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:01,362 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-04-28 10:27:01,363 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-04-28 10:27:01,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:27:01,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:01,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:27:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:01,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:01,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {1422#true} call ULTIMATE.init(); {1422#true} is VALID [2022-04-28 10:27:01,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {1422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:01,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#(<= 40000 ~SIZE~0)} assume true; {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:01,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#(<= 40000 ~SIZE~0)} {1422#true} #45#return; {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:01,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:01,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1443#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:01,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1443#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1447#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:01,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {1447#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1451#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:01,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {1451#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1455#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:01,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {1455#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:01,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {1459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1463#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:01,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {1463#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:01,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1471#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:01,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1471#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {1423#false} is VALID [2022-04-28 10:27:01,656 INFO L272 TraceCheckUtils]: 14: Hoare triple {1423#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1423#false} is VALID [2022-04-28 10:27:01,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#false} ~cond := #in~cond; {1423#false} is VALID [2022-04-28 10:27:01,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {1423#false} assume 0 == ~cond; {1423#false} is VALID [2022-04-28 10:27:01,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {1423#false} assume !false; {1423#false} is VALID [2022-04-28 10:27:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:01,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:01,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {1423#false} assume !false; {1423#false} is VALID [2022-04-28 10:27:01,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {1423#false} assume 0 == ~cond; {1423#false} is VALID [2022-04-28 10:27:01,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#false} ~cond := #in~cond; {1423#false} is VALID [2022-04-28 10:27:01,946 INFO L272 TraceCheckUtils]: 14: Hoare triple {1423#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1423#false} is VALID [2022-04-28 10:27:01,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1423#false} is VALID [2022-04-28 10:27:01,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1499#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:01,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1503#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:01,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {1511#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1507#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:01,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {1515#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1511#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:01,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1515#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:01,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1519#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:01,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1523#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:01,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#(< 7 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1527#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:01,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#(< 7 ~SIZE~0)} call #t~ret4 := main(); {1531#(< 7 ~SIZE~0)} is VALID [2022-04-28 10:27:01,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#(< 7 ~SIZE~0)} {1422#true} #45#return; {1531#(< 7 ~SIZE~0)} is VALID [2022-04-28 10:27:01,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#(< 7 ~SIZE~0)} assume true; {1531#(< 7 ~SIZE~0)} is VALID [2022-04-28 10:27:01,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1531#(< 7 ~SIZE~0)} is VALID [2022-04-28 10:27:01,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {1422#true} call ULTIMATE.init(); {1422#true} is VALID [2022-04-28 10:27:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926456649] [2022-04-28 10:27:01,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887153278] [2022-04-28 10:27:01,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887153278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:01,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:01,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 10:27:01,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059240772] [2022-04-28 10:27:01,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059240772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:01,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:01,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:27:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864563983] [2022-04-28 10:27:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:01,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:27:01,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:01,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:01,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:01,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:27:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:27:01,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:27:01,973 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:10,104 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:27:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:27:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:27:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 10:27:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 10:27:10,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-28 10:27:10,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:10,130 INFO L225 Difference]: With dead ends: 25 [2022-04-28 10:27:10,130 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:27:10,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:27:10,131 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:10,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:27:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:27:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 10:27:10,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:10,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,148 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,148 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:10,149 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:27:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:27:10,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:10,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:10,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:27:10,150 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:27:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:10,151 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:27:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:27:10,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:10,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:10,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:10,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 10:27:10,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-28 10:27:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:10,152 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 10:27:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:10,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 10:27:10,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:27:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:27:10,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:10,170 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:10,194 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-04-28 10:27:10,370 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,SelfDestructingSolverStorable7 [2022-04-28 10:27:10,371 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1845062869, now seen corresponding path program 15 times [2022-04-28 10:27:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:10,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704237015] [2022-04-28 10:27:10,406 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:10,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1845062869, now seen corresponding path program 16 times [2022-04-28 10:27:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775584902] [2022-04-28 10:27:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:10,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:10,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257372831] [2022-04-28 10:27:10,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:27:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:10,428 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-04-28 10:27:10,429 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-04-28 10:27:10,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:27:10,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:10,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:27:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:10,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:10,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2022-04-28 10:27:10,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:10,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#(<= 40000 ~SIZE~0)} assume true; {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:10,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#(<= 40000 ~SIZE~0)} {1679#true} #45#return; {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:10,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:10,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1700#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:10,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1700#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1704#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:10,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1704#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1708#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:10,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1708#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:10,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:10,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {1716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1720#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:10,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:10,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1728#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:10,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:10,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {1732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !(~i~0 < ~SIZE~0); {1680#false} is VALID [2022-04-28 10:27:10,750 INFO L272 TraceCheckUtils]: 15: Hoare triple {1680#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1680#false} is VALID [2022-04-28 10:27:10,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2022-04-28 10:27:10,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {1680#false} assume 0 == ~cond; {1680#false} is VALID [2022-04-28 10:27:10,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2022-04-28 10:27:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:10,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:11,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2022-04-28 10:27:11,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {1680#false} assume 0 == ~cond; {1680#false} is VALID [2022-04-28 10:27:11,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2022-04-28 10:27:11,046 INFO L272 TraceCheckUtils]: 15: Hoare triple {1680#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1680#false} is VALID [2022-04-28 10:27:11,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1680#false} is VALID [2022-04-28 10:27:11,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1764#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1760#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:11,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {1768#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1764#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:11,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1768#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:11,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {1776#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1772#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:11,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1776#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:11,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {1784#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1780#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:11,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1784#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:11,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1788#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:11,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#(< 8 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1792#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:11,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#(< 8 ~SIZE~0)} call #t~ret4 := main(); {1796#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:27:11,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#(< 8 ~SIZE~0)} {1679#true} #45#return; {1796#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:27:11,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#(< 8 ~SIZE~0)} assume true; {1796#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:27:11,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1796#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:27:11,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2022-04-28 10:27:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:11,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775584902] [2022-04-28 10:27:11,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:11,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257372831] [2022-04-28 10:27:11,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257372831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:11,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:11,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 10:27:11,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:11,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704237015] [2022-04-28 10:27:11,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704237015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:11,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:11,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:27:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431698181] [2022-04-28 10:27:11,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:11,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:27:11,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:11,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:11,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:11,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:27:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:27:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:27:11,082 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:15,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:17,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:17,855 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:27:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:27:17,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:27:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 10:27:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 10:27:17,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-28 10:27:17,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:17,877 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:27:17,882 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:27:17,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:27:17,883 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:17,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 10:27:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:27:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 10:27:17,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:17,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,901 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,901 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:17,902 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:27:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:27:17,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:17,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:17,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:27:17,903 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:27:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:17,904 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:27:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:27:17,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:17,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:17,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:17,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 10:27:17,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-28 10:27:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:17,905 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 10:27:17,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:17,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 10:27:17,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:27:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:27:17,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:17,927 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:17,943 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-04-28 10:27:18,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:18,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1327879022, now seen corresponding path program 17 times [2022-04-28 10:27:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:18,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846780993] [2022-04-28 10:27:18,134 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:18,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1327879022, now seen corresponding path program 18 times [2022-04-28 10:27:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:18,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089133288] [2022-04-28 10:27:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:18,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324843953] [2022-04-28 10:27:18,155 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:27:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:18,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:18,156 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-04-28 10:27:18,160 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-04-28 10:27:18,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:27:18,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:18,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:27:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:18,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:18,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {1950#true} call ULTIMATE.init(); {1950#true} is VALID [2022-04-28 10:27:18,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:18,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {1958#(<= 40000 ~SIZE~0)} assume true; {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:18,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1958#(<= 40000 ~SIZE~0)} {1950#true} #45#return; {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:18,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {1958#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:18,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {1958#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:18,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:18,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:18,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:18,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {1983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:18,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {1987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:18,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1995#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:18,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {1995#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1999#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:18,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {1999#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2003#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:18,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {2003#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:18,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {2007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !(~i~0 < ~SIZE~0); {1951#false} is VALID [2022-04-28 10:27:18,524 INFO L272 TraceCheckUtils]: 16: Hoare triple {1951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1951#false} is VALID [2022-04-28 10:27:18,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {1951#false} ~cond := #in~cond; {1951#false} is VALID [2022-04-28 10:27:18,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {1951#false} assume 0 == ~cond; {1951#false} is VALID [2022-04-28 10:27:18,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {1951#false} assume !false; {1951#false} is VALID [2022-04-28 10:27:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:18,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:18,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {1951#false} assume !false; {1951#false} is VALID [2022-04-28 10:27:18,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1951#false} assume 0 == ~cond; {1951#false} is VALID [2022-04-28 10:27:18,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {1951#false} ~cond := #in~cond; {1951#false} is VALID [2022-04-28 10:27:18,820 INFO L272 TraceCheckUtils]: 16: Hoare triple {1951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1951#false} is VALID [2022-04-28 10:27:18,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {2035#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1951#false} is VALID [2022-04-28 10:27:18,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2035#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:18,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {2043#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2039#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:18,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {2047#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2043#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:18,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {2051#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2047#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:18,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {2055#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2051#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:18,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {2059#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2055#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:18,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2059#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:18,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {2067#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2063#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:18,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {2071#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2067#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:18,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {2075#(< 9 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2071#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:18,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {2075#(< 9 ~SIZE~0)} call #t~ret4 := main(); {2075#(< 9 ~SIZE~0)} is VALID [2022-04-28 10:27:18,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2075#(< 9 ~SIZE~0)} {1950#true} #45#return; {2075#(< 9 ~SIZE~0)} is VALID [2022-04-28 10:27:18,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {2075#(< 9 ~SIZE~0)} assume true; {2075#(< 9 ~SIZE~0)} is VALID [2022-04-28 10:27:18,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2075#(< 9 ~SIZE~0)} is VALID [2022-04-28 10:27:18,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1950#true} call ULTIMATE.init(); {1950#true} is VALID [2022-04-28 10:27:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:18,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089133288] [2022-04-28 10:27:18,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:18,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324843953] [2022-04-28 10:27:18,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324843953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:18,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:18,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 10:27:18,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:18,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846780993] [2022-04-28 10:27:18,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846780993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:18,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:18,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:27:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918795906] [2022-04-28 10:27:18,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:18,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:27:18,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:18,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:18,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:18,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:27:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:18,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:27:18,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:27:18,847 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:19,491 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:27:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:27:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:27:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 10:27:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 10:27:19,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-28 10:27:19,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:19,513 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:27:19,514 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:27:19,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:27:19,514 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:19,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:27:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:27:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 10:27:19,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:19,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,530 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,530 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:19,531 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:27:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:27:19,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:19,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:19,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:27:19,531 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:27:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:19,532 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:27:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:27:19,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:19,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:19,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:19,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 10:27:19,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-28 10:27:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:19,534 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 10:27:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:19,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 10:27:19,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:27:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:27:19,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:19,568 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:19,589 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-04-28 10:27:19,769 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,SelfDestructingSolverStorable9 [2022-04-28 10:27:19,769 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918347, now seen corresponding path program 19 times [2022-04-28 10:27:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:19,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992388466] [2022-04-28 10:27:19,772 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:19,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918347, now seen corresponding path program 20 times [2022-04-28 10:27:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:19,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733845499] [2022-04-28 10:27:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:19,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:19,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538096399] [2022-04-28 10:27:19,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:27:19,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:19,786 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-04-28 10:27:19,791 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-04-28 10:27:19,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:27:19,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:19,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:27:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:19,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:20,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {2235#true} call ULTIMATE.init(); {2235#true} is VALID [2022-04-28 10:27:20,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:20,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {2243#(<= 40000 ~SIZE~0)} assume true; {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:20,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2243#(<= 40000 ~SIZE~0)} {2235#true} #45#return; {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:20,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {2243#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:20,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {2243#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2256#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:20,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {2256#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2260#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:20,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2264#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:20,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:20,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {2268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:20,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {2272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2276#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:20,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2280#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:20,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2284#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:20,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {2284#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:20,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {2288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:20,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {2292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2296#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:20,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {2296#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {2236#false} is VALID [2022-04-28 10:27:20,143 INFO L272 TraceCheckUtils]: 17: Hoare triple {2236#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2236#false} is VALID [2022-04-28 10:27:20,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} ~cond := #in~cond; {2236#false} is VALID [2022-04-28 10:27:20,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} assume 0 == ~cond; {2236#false} is VALID [2022-04-28 10:27:20,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-04-28 10:27:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:20,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:20,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-04-28 10:27:20,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} assume 0 == ~cond; {2236#false} is VALID [2022-04-28 10:27:20,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} ~cond := #in~cond; {2236#false} is VALID [2022-04-28 10:27:20,466 INFO L272 TraceCheckUtils]: 17: Hoare triple {2236#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2236#false} is VALID [2022-04-28 10:27:20,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {2324#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2236#false} is VALID [2022-04-28 10:27:20,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {2328#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2324#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:20,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {2332#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2328#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:20,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {2336#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2332#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:20,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {2340#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2336#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:20,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {2344#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2340#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:20,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {2348#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2344#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:20,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {2352#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2348#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:20,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {2356#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2352#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:20,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {2360#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2356#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:20,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {2364#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2360#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:20,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {2368#(< 10 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2364#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:27:20,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {2368#(< 10 ~SIZE~0)} call #t~ret4 := main(); {2368#(< 10 ~SIZE~0)} is VALID [2022-04-28 10:27:20,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2368#(< 10 ~SIZE~0)} {2235#true} #45#return; {2368#(< 10 ~SIZE~0)} is VALID [2022-04-28 10:27:20,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#(< 10 ~SIZE~0)} assume true; {2368#(< 10 ~SIZE~0)} is VALID [2022-04-28 10:27:20,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2368#(< 10 ~SIZE~0)} is VALID [2022-04-28 10:27:20,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {2235#true} call ULTIMATE.init(); {2235#true} is VALID [2022-04-28 10:27:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733845499] [2022-04-28 10:27:20,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538096399] [2022-04-28 10:27:20,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538096399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:20,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:20,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 10:27:20,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992388466] [2022-04-28 10:27:20,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992388466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:20,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:20,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:27:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640171584] [2022-04-28 10:27:20,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:27:20,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:20,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:20,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:20,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:27:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:27:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:27:20,498 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:26,597 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:27:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:27:26,597 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:27:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 10:27:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 10:27:26,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-28 10:27:26,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:26,622 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:27:26,622 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:27:26,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:27:26,623 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:26,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:27:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:27:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:27:26,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:26,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,641 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,641 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:26,642 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:27:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:27:26,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:26,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:26,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:27:26,643 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:27:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:26,644 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:27:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:27:26,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:26,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:26,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:26,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 10:27:26,645 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-28 10:27:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:26,645 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 10:27:26,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:26,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 10:27:26,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:27:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:27:26,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:26,661 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:26,677 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-04-28 10:27:26,862 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,SelfDestructingSolverStorable10 [2022-04-28 10:27:26,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 617388978, now seen corresponding path program 21 times [2022-04-28 10:27:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:26,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645794617] [2022-04-28 10:27:26,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:26,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash 617388978, now seen corresponding path program 22 times [2022-04-28 10:27:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:26,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091781004] [2022-04-28 10:27:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:26,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:26,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741604988] [2022-04-28 10:27:26,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:27:26,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:26,897 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-04-28 10:27:26,898 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-04-28 10:27:26,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:27:26,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:26,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:27:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:26,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:27,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {2534#true} call ULTIMATE.init(); {2534#true} is VALID [2022-04-28 10:27:27,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {2534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:27,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2542#(<= 40000 ~SIZE~0)} assume true; {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:27,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2542#(<= 40000 ~SIZE~0)} {2534#true} #45#return; {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:27,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {2542#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:27,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {2542#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:27,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:27,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:27,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {2563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:27,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:27,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {2571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2575#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:27,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {2575#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:27,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {2579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2583#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:27,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {2583#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:27,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {2587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:27,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {2591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2595#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:27,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {2595#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2599#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:27:27,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {2599#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !(~i~0 < ~SIZE~0); {2535#false} is VALID [2022-04-28 10:27:27,317 INFO L272 TraceCheckUtils]: 18: Hoare triple {2535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2535#false} is VALID [2022-04-28 10:27:27,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {2535#false} ~cond := #in~cond; {2535#false} is VALID [2022-04-28 10:27:27,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {2535#false} assume 0 == ~cond; {2535#false} is VALID [2022-04-28 10:27:27,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {2535#false} assume !false; {2535#false} is VALID [2022-04-28 10:27:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:27,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:27,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {2535#false} assume !false; {2535#false} is VALID [2022-04-28 10:27:27,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {2535#false} assume 0 == ~cond; {2535#false} is VALID [2022-04-28 10:27:27,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {2535#false} ~cond := #in~cond; {2535#false} is VALID [2022-04-28 10:27:27,676 INFO L272 TraceCheckUtils]: 18: Hoare triple {2535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2535#false} is VALID [2022-04-28 10:27:27,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {2627#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2535#false} is VALID [2022-04-28 10:27:27,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {2631#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2627#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:27,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {2635#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2631#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:27,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2635#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:27,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {2643#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2639#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:27,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {2647#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2643#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:27,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2647#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:27,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {2655#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2651#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:27,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2655#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:27,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {2663#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2659#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:27,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2667#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2663#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:27,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {2671#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2667#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:27:27,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {2675#(< 11 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2671#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:27:27,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {2675#(< 11 ~SIZE~0)} call #t~ret4 := main(); {2675#(< 11 ~SIZE~0)} is VALID [2022-04-28 10:27:27,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2675#(< 11 ~SIZE~0)} {2534#true} #45#return; {2675#(< 11 ~SIZE~0)} is VALID [2022-04-28 10:27:27,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {2675#(< 11 ~SIZE~0)} assume true; {2675#(< 11 ~SIZE~0)} is VALID [2022-04-28 10:27:27,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {2534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2675#(< 11 ~SIZE~0)} is VALID [2022-04-28 10:27:27,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {2534#true} call ULTIMATE.init(); {2534#true} is VALID [2022-04-28 10:27:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:27,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091781004] [2022-04-28 10:27:27,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741604988] [2022-04-28 10:27:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741604988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:27,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:27,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 10:27:27,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645794617] [2022-04-28 10:27:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645794617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:27,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:27,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:27:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203767627] [2022-04-28 10:27:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:27:27,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:27,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:27,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:27,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:27:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:27:27,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:27:27,711 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:30,093 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:27:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:27:30,093 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:27:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 10:27:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 10:27:30,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-28 10:27:30,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:30,120 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:27:30,120 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:27:30,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:27:30,121 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:30,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:27:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:27:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 10:27:30,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:30,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,142 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,142 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:30,142 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:27:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:27:30,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:30,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:30,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:27:30,143 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:27:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:30,144 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:27:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:27:30,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:30,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:30,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:30,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 10:27:30,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-28 10:27:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:30,145 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 10:27:30,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:30,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 10:27:30,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:27:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:27:30,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:30,179 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:30,204 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-04-28 10:27:30,387 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,SelfDestructingSolverStorable11 [2022-04-28 10:27:30,387 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1993684203, now seen corresponding path program 23 times [2022-04-28 10:27:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:30,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106315800] [2022-04-28 10:27:30,390 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:30,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1993684203, now seen corresponding path program 24 times [2022-04-28 10:27:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:30,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956583788] [2022-04-28 10:27:30,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:30,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:30,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376612586] [2022-04-28 10:27:30,404 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:27:30,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:30,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:30,405 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-04-28 10:27:30,406 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-04-28 10:27:30,451 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:27:30,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:30,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:27:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:30,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:30,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-28 10:27:30,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:30,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#(<= 40000 ~SIZE~0)} assume true; {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:30,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#(<= 40000 ~SIZE~0)} {2847#true} #45#return; {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:30,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:30,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2868#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:30,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {2868#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2872#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:30,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:30,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:30,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:30,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2888#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:30,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {2888#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:30,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {2892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2896#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:30,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {2896#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:30,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:30,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {2904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2908#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:30,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {2908#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:27:30,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {2912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:27:30,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {2916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !(~i~0 < ~SIZE~0); {2848#false} is VALID [2022-04-28 10:27:30,813 INFO L272 TraceCheckUtils]: 19: Hoare triple {2848#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2848#false} is VALID [2022-04-28 10:27:30,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-28 10:27:30,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-28 10:27:30,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-28 10:27:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:30,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:31,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-28 10:27:31,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-28 10:27:31,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-28 10:27:31,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {2848#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2848#false} is VALID [2022-04-28 10:27:31,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2848#false} is VALID [2022-04-28 10:27:31,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {2948#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2944#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:31,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2948#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:31,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {2956#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2952#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:31,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2960#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2956#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:31,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2960#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:31,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {2968#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2964#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:31,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {2972#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2968#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:31,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {2976#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2972#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:31,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {2980#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2976#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:31,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {2984#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2980#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:31,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {2988#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2984#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:27:31,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {2992#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2988#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:27:31,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {2996#(< 12 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2992#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:27:31,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {2996#(< 12 ~SIZE~0)} call #t~ret4 := main(); {2996#(< 12 ~SIZE~0)} is VALID [2022-04-28 10:27:31,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2996#(< 12 ~SIZE~0)} {2847#true} #45#return; {2996#(< 12 ~SIZE~0)} is VALID [2022-04-28 10:27:31,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#(< 12 ~SIZE~0)} assume true; {2996#(< 12 ~SIZE~0)} is VALID [2022-04-28 10:27:31,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2996#(< 12 ~SIZE~0)} is VALID [2022-04-28 10:27:31,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-28 10:27:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956583788] [2022-04-28 10:27:31,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376612586] [2022-04-28 10:27:31,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376612586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:31,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:31,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 10:27:31,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106315800] [2022-04-28 10:27:31,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106315800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:31,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:31,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:27:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194511684] [2022-04-28 10:27:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:31,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:27:31,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:31,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:31,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:31,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:27:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:27:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:27:31,257 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:35,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:37,453 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:27:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:27:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:27:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 10:27:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 10:27:37,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-28 10:27:37,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:37,491 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:27:37,491 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:27:37,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:27:37,492 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:37,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:27:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:27:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 10:27:37,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:37,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,513 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,513 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:37,514 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:27:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:27:37,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:37,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:37,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:27:37,514 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:27:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:37,515 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:27:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:27:37,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:37,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:37,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:37,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 10:27:37,516 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-28 10:27:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:37,516 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 10:27:37,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:37,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 10:27:37,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:27:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:27:37,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:37,539 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:37,556 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-04-28 10:27:37,739 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,SelfDestructingSolverStorable12 [2022-04-28 10:27:37,740 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1709163218, now seen corresponding path program 25 times [2022-04-28 10:27:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:37,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414572343] [2022-04-28 10:27:37,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:37,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1709163218, now seen corresponding path program 26 times [2022-04-28 10:27:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:37,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230979284] [2022-04-28 10:27:37,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:37,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:37,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:37,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147133892] [2022-04-28 10:27:37,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:27:37,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:37,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:37,767 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-04-28 10:27:37,768 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-04-28 10:27:37,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:27:37,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:37,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:27:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:37,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:38,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {3174#true} call ULTIMATE.init(); {3174#true} is VALID [2022-04-28 10:27:38,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {3174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:38,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#(<= 40000 ~SIZE~0)} assume true; {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:38,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#(<= 40000 ~SIZE~0)} {3174#true} #45#return; {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:38,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:38,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:38,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {3195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:38,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {3199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3203#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:38,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {3203#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:38,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:38,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {3211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3215#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:38,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {3215#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:38,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {3219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3223#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:38,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {3223#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:38,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:38,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {3231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3235#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:38,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3239#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:27:38,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:27:38,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {3243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3247#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:38,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {3247#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {3175#false} is VALID [2022-04-28 10:27:38,201 INFO L272 TraceCheckUtils]: 20: Hoare triple {3175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3175#false} is VALID [2022-04-28 10:27:38,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#false} ~cond := #in~cond; {3175#false} is VALID [2022-04-28 10:27:38,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#false} assume 0 == ~cond; {3175#false} is VALID [2022-04-28 10:27:38,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#false} assume !false; {3175#false} is VALID [2022-04-28 10:27:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:38,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:38,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#false} assume !false; {3175#false} is VALID [2022-04-28 10:27:38,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#false} assume 0 == ~cond; {3175#false} is VALID [2022-04-28 10:27:38,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#false} ~cond := #in~cond; {3175#false} is VALID [2022-04-28 10:27:38,624 INFO L272 TraceCheckUtils]: 20: Hoare triple {3175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3175#false} is VALID [2022-04-28 10:27:38,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {3275#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {3175#false} is VALID [2022-04-28 10:27:38,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {3279#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3275#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:38,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {3283#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3279#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:38,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {3287#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3283#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:38,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {3291#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3287#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:38,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3291#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:38,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {3299#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3295#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:38,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3299#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:38,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {3307#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3303#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:38,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {3311#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3307#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:38,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3315#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3311#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:38,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {3319#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3315#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:27:38,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {3323#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3319#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:27:38,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {3327#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3323#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:27:38,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {3331#(< 13 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3327#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:27:38,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {3331#(< 13 ~SIZE~0)} call #t~ret4 := main(); {3331#(< 13 ~SIZE~0)} is VALID [2022-04-28 10:27:38,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3331#(< 13 ~SIZE~0)} {3174#true} #45#return; {3331#(< 13 ~SIZE~0)} is VALID [2022-04-28 10:27:38,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {3331#(< 13 ~SIZE~0)} assume true; {3331#(< 13 ~SIZE~0)} is VALID [2022-04-28 10:27:38,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {3174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3331#(< 13 ~SIZE~0)} is VALID [2022-04-28 10:27:38,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {3174#true} call ULTIMATE.init(); {3174#true} is VALID [2022-04-28 10:27:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230979284] [2022-04-28 10:27:38,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147133892] [2022-04-28 10:27:38,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147133892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:38,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:38,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 10:27:38,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:38,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414572343] [2022-04-28 10:27:38,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414572343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:38,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:38,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:27:38,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566744949] [2022-04-28 10:27:38,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:27:38,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:38,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:38,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:38,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:27:38,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:38,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:27:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:27:38,662 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:44,793 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:27:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:27:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:27:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 10:27:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 10:27:44,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-28 10:27:44,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:44,820 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:27:44,820 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:27:44,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:27:44,821 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:44,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:27:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:27:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 10:27:44,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:44,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,845 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,846 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:44,846 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:27:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:27:44,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:44,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:44,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:27:44,847 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:27:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:44,847 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:27:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:27:44,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:44,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:44,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:44,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 10:27:44,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-28 10:27:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:44,849 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 10:27:44,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:44,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 10:27:44,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:27:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:27:44,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:44,870 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:44,888 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-04-28 10:27:45,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:45,071 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1478947275, now seen corresponding path program 27 times [2022-04-28 10:27:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1462890247] [2022-04-28 10:27:45,077 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:45,077 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1478947275, now seen corresponding path program 28 times [2022-04-28 10:27:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:45,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676265104] [2022-04-28 10:27:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:45,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605236026] [2022-04-28 10:27:45,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:27:45,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:45,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:45,092 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-04-28 10:27:45,135 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-04-28 10:27:45,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:27:45,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:45,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:27:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:45,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:45,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {3515#true} call ULTIMATE.init(); {3515#true} is VALID [2022-04-28 10:27:45,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:45,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {3523#(<= 40000 ~SIZE~0)} assume true; {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:45,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3523#(<= 40000 ~SIZE~0)} {3515#true} #45#return; {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:45,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {3523#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:45,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {3523#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3536#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {3536#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3540#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3540#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3544#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:45,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {3544#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3548#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:45,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {3548#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3552#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:45,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {3552#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3556#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {3556#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3560#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:45,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {3560#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3564#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {3564#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3568#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:45,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3572#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:45,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {3572#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3576#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {3576#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3580#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:27:45,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {3580#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3584#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:27:45,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {3584#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3588#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {3588#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3592#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:45,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {3592#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {3516#false} is VALID [2022-04-28 10:27:45,552 INFO L272 TraceCheckUtils]: 21: Hoare triple {3516#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3516#false} is VALID [2022-04-28 10:27:45,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {3516#false} ~cond := #in~cond; {3516#false} is VALID [2022-04-28 10:27:45,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {3516#false} assume 0 == ~cond; {3516#false} is VALID [2022-04-28 10:27:45,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {3516#false} assume !false; {3516#false} is VALID [2022-04-28 10:27:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:45,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:46,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {3516#false} assume !false; {3516#false} is VALID [2022-04-28 10:27:46,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {3516#false} assume 0 == ~cond; {3516#false} is VALID [2022-04-28 10:27:46,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {3516#false} ~cond := #in~cond; {3516#false} is VALID [2022-04-28 10:27:46,034 INFO L272 TraceCheckUtils]: 21: Hoare triple {3516#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3516#false} is VALID [2022-04-28 10:27:46,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {3620#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {3516#false} is VALID [2022-04-28 10:27:46,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3620#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:46,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {3628#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3624#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:46,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {3632#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3628#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:46,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {3636#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3632#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:46,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {3640#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3636#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:46,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {3644#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3640#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:46,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {3648#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3644#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:46,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {3652#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3648#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:46,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {3656#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3652#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:46,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {3660#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3656#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:46,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {3664#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3660#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:27:46,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {3668#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3664#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:27:46,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {3672#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3668#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:27:46,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {3676#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3672#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:27:46,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {3680#(< 14 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3676#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:27:46,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {3680#(< 14 ~SIZE~0)} call #t~ret4 := main(); {3680#(< 14 ~SIZE~0)} is VALID [2022-04-28 10:27:46,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3680#(< 14 ~SIZE~0)} {3515#true} #45#return; {3680#(< 14 ~SIZE~0)} is VALID [2022-04-28 10:27:46,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {3680#(< 14 ~SIZE~0)} assume true; {3680#(< 14 ~SIZE~0)} is VALID [2022-04-28 10:27:46,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3680#(< 14 ~SIZE~0)} is VALID [2022-04-28 10:27:46,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {3515#true} call ULTIMATE.init(); {3515#true} is VALID [2022-04-28 10:27:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:46,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:46,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676265104] [2022-04-28 10:27:46,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:46,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605236026] [2022-04-28 10:27:46,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605236026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:46,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:46,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 10:27:46,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:46,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1462890247] [2022-04-28 10:27:46,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1462890247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:46,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:46,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:27:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61027949] [2022-04-28 10:27:46,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:27:46,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:46,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:46,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:46,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:27:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:27:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:27:46,064 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:50,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:55,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:27:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:55,019 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:27:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:27:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:27:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:27:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 10:27:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 10:27:55,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-28 10:27:55,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:55,048 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:27:55,048 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:27:55,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:27:55,049 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:27:55,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 10:27:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:27:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 10:27:55,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:27:55,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,071 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,071 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:55,071 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:27:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:27:55,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:55,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:55,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:27:55,072 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:27:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:27:55,073 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:27:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:27:55,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:27:55,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:27:55,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:27:55,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:27:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 10:27:55,074 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-28 10:27:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:27:55,074 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 10:27:55,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:55,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 10:27:55,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:27:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:27:55,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:27:55,095 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:27:55,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 10:27:55,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 10:27:55,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:27:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:27:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1362779662, now seen corresponding path program 29 times [2022-04-28 10:27:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1766280453] [2022-04-28 10:27:55,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:27:55,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:27:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1362779662, now seen corresponding path program 30 times [2022-04-28 10:27:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:27:55,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885598207] [2022-04-28 10:27:55,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:27:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:27:55,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:27:55,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193440681] [2022-04-28 10:27:55,313 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:27:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:27:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:27:55,314 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-04-28 10:27:55,335 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-04-28 10:27:55,364 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:27:55,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:27:55,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:27:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:27:55,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:27:55,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {3870#true} call ULTIMATE.init(); {3870#true} is VALID [2022-04-28 10:27:55,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {3870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:55,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {3878#(<= 40000 ~SIZE~0)} assume true; {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:55,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3878#(<= 40000 ~SIZE~0)} {3870#true} #45#return; {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:55,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {3878#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:27:55,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {3878#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3891#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {3891#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3895#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {3895#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3899#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:27:55,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {3899#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3903#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:27:55,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {3903#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3907#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:27:55,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {3907#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3911#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3915#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:27:55,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {3915#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3919#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {3919#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3923#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:27:55,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {3923#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3927#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:27:55,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {3927#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3931#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {3931#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3935#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:27:55,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {3935#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:27:55,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {3939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3943#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {3943#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3947#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {3947#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3951#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:27:55,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {3951#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {3871#false} is VALID [2022-04-28 10:27:55,814 INFO L272 TraceCheckUtils]: 22: Hoare triple {3871#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3871#false} is VALID [2022-04-28 10:27:55,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#false} ~cond := #in~cond; {3871#false} is VALID [2022-04-28 10:27:55,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {3871#false} assume 0 == ~cond; {3871#false} is VALID [2022-04-28 10:27:55,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {3871#false} assume !false; {3871#false} is VALID [2022-04-28 10:27:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:55,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:27:56,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {3871#false} assume !false; {3871#false} is VALID [2022-04-28 10:27:56,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {3871#false} assume 0 == ~cond; {3871#false} is VALID [2022-04-28 10:27:56,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#false} ~cond := #in~cond; {3871#false} is VALID [2022-04-28 10:27:56,358 INFO L272 TraceCheckUtils]: 22: Hoare triple {3871#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3871#false} is VALID [2022-04-28 10:27:56,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {3979#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {3871#false} is VALID [2022-04-28 10:27:56,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {3983#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3979#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:27:56,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {3987#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3983#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:27:56,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {3991#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3987#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:27:56,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {3995#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3991#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:27:56,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {3999#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3995#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:27:56,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {4003#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3999#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:56,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {4007#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4003#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:27:56,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {4011#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4007#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:27:56,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {4015#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4011#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:27:56,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {4019#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4015#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:27:56,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {4023#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4019#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:27:56,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {4027#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4023#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:27:56,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {4031#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4027#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:27:56,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {4035#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4031#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:27:56,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {4039#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4035#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:27:56,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {4043#(< 15 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4039#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:27:56,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {4043#(< 15 ~SIZE~0)} call #t~ret4 := main(); {4043#(< 15 ~SIZE~0)} is VALID [2022-04-28 10:27:56,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4043#(< 15 ~SIZE~0)} {3870#true} #45#return; {4043#(< 15 ~SIZE~0)} is VALID [2022-04-28 10:27:56,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {4043#(< 15 ~SIZE~0)} assume true; {4043#(< 15 ~SIZE~0)} is VALID [2022-04-28 10:27:56,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {3870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4043#(< 15 ~SIZE~0)} is VALID [2022-04-28 10:27:56,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {3870#true} call ULTIMATE.init(); {3870#true} is VALID [2022-04-28 10:27:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:27:56,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:27:56,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885598207] [2022-04-28 10:27:56,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:27:56,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193440681] [2022-04-28 10:27:56,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193440681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:27:56,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:27:56,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 10:27:56,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:27:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1766280453] [2022-04-28 10:27:56,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1766280453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:27:56,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:27:56,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:27:56,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075282032] [2022-04-28 10:27:56,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:27:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:27:56,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:27:56,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:27:56,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:27:56,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:27:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:27:56,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:27:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:27:56,392 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:03,258 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:28:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:28:03,259 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:28:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 10:28:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 10:28:03,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-28 10:28:03,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:03,284 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:28:03,284 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:28:03,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:28:03,285 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:03,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:28:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:28:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:28:03,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:03,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,308 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,309 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:03,311 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:28:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:28:03,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:03,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:03,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:28:03,312 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:28:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:03,313 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:28:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:28:03,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:03,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:03,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:03,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 10:28:03,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-28 10:28:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:03,314 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 10:28:03,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:03,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 10:28:03,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:28:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:28:03,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:03,334 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:03,351 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-04-28 10:28:03,535 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,SelfDestructingSolverStorable15 [2022-04-28 10:28:03,535 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash 737998507, now seen corresponding path program 31 times [2022-04-28 10:28:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531652107] [2022-04-28 10:28:03,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:03,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash 737998507, now seen corresponding path program 32 times [2022-04-28 10:28:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:03,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185614420] [2022-04-28 10:28:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:03,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:03,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133915142] [2022-04-28 10:28:03,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:28:03,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:03,572 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-04-28 10:28:03,574 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-04-28 10:28:03,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:28:03,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:03,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:28:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:03,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:04,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {4239#true} call ULTIMATE.init(); {4239#true} is VALID [2022-04-28 10:28:04,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {4239#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:04,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#(<= 40000 ~SIZE~0)} assume true; {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:04,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#(<= 40000 ~SIZE~0)} {4239#true} #45#return; {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:04,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:04,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {4247#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {4260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4264#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {4264#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:04,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {4268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:04,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {4272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4276#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:04,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {4276#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4280#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {4280#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:04,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {4284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4288#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:04,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {4292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4296#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:04,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {4296#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4300#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {4300#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:04,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {4304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:04,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {4308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4312#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {4312#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4316#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {4316#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4320#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4324#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:04,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {4324#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {4240#false} is VALID [2022-04-28 10:28:04,085 INFO L272 TraceCheckUtils]: 23: Hoare triple {4240#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4240#false} is VALID [2022-04-28 10:28:04,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {4240#false} ~cond := #in~cond; {4240#false} is VALID [2022-04-28 10:28:04,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {4240#false} assume 0 == ~cond; {4240#false} is VALID [2022-04-28 10:28:04,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {4240#false} assume !false; {4240#false} is VALID [2022-04-28 10:28:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:04,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:04,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {4240#false} assume !false; {4240#false} is VALID [2022-04-28 10:28:04,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {4240#false} assume 0 == ~cond; {4240#false} is VALID [2022-04-28 10:28:04,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {4240#false} ~cond := #in~cond; {4240#false} is VALID [2022-04-28 10:28:04,676 INFO L272 TraceCheckUtils]: 23: Hoare triple {4240#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4240#false} is VALID [2022-04-28 10:28:04,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {4352#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {4240#false} is VALID [2022-04-28 10:28:04,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {4356#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4352#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:04,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {4360#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4356#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:04,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {4364#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4360#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:04,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {4368#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4364#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:04,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4368#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:04,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4372#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:04,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {4380#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4376#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:04,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {4384#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4380#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:04,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {4388#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4384#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:04,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {4392#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4388#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:04,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {4396#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4392#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:04,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {4400#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4396#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:04,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {4404#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4400#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:04,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {4408#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4404#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:04,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {4412#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4408#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:04,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {4416#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4412#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:04,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {4420#(< 16 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4416#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:04,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {4420#(< 16 ~SIZE~0)} call #t~ret4 := main(); {4420#(< 16 ~SIZE~0)} is VALID [2022-04-28 10:28:04,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4420#(< 16 ~SIZE~0)} {4239#true} #45#return; {4420#(< 16 ~SIZE~0)} is VALID [2022-04-28 10:28:04,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {4420#(< 16 ~SIZE~0)} assume true; {4420#(< 16 ~SIZE~0)} is VALID [2022-04-28 10:28:04,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {4239#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4420#(< 16 ~SIZE~0)} is VALID [2022-04-28 10:28:04,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {4239#true} call ULTIMATE.init(); {4239#true} is VALID [2022-04-28 10:28:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:04,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185614420] [2022-04-28 10:28:04,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:04,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133915142] [2022-04-28 10:28:04,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133915142] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:04,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:04,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-28 10:28:04,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531652107] [2022-04-28 10:28:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531652107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:04,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:28:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066866226] [2022-04-28 10:28:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:04,690 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:28:04,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:04,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:04,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:04,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:28:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:28:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:28:04,710 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:10,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:28:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:15,118 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:28:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:28:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:28:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 10:28:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 10:28:15,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-28 10:28:15,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:15,145 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:28:15,145 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:28:15,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:28:15,146 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:15,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 10:28:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:28:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:28:15,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:15,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,168 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,168 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:15,169 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:28:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:28:15,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:15,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:15,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:28:15,169 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:28:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:15,170 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:28:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:28:15,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:15,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:15,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:15,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 10:28:15,170 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-28 10:28:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:15,171 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 10:28:15,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:15,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 10:28:15,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:28:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:28:15,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:15,201 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:15,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 10:28:15,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:28:15,404 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1437612306, now seen corresponding path program 33 times [2022-04-28 10:28:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478390201] [2022-04-28 10:28:15,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:15,407 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1437612306, now seen corresponding path program 34 times [2022-04-28 10:28:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:15,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292917121] [2022-04-28 10:28:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:15,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:15,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985959584] [2022-04-28 10:28:15,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:28:15,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:15,440 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-04-28 10:28:15,443 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-04-28 10:28:15,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:28:15,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:15,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:28:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:15,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:15,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {4622#true} call ULTIMATE.init(); {4622#true} is VALID [2022-04-28 10:28:15,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:15,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {4630#(<= 40000 ~SIZE~0)} assume true; {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:15,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4630#(<= 40000 ~SIZE~0)} {4622#true} #45#return; {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:15,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {4630#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:15,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {4630#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:15,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:15,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {4655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:15,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {4659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {4663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:15,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {4667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {4671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:15,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {4675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:15,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {4679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {4683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:15,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {4687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:15,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {4691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {4695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {4699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {4703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:15,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {4707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:15,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {4711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !(~i~0 < ~SIZE~0); {4623#false} is VALID [2022-04-28 10:28:15,974 INFO L272 TraceCheckUtils]: 24: Hoare triple {4623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4623#false} is VALID [2022-04-28 10:28:15,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#false} ~cond := #in~cond; {4623#false} is VALID [2022-04-28 10:28:15,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {4623#false} assume 0 == ~cond; {4623#false} is VALID [2022-04-28 10:28:15,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {4623#false} assume !false; {4623#false} is VALID [2022-04-28 10:28:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:15,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:16,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {4623#false} assume !false; {4623#false} is VALID [2022-04-28 10:28:16,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {4623#false} assume 0 == ~cond; {4623#false} is VALID [2022-04-28 10:28:16,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#false} ~cond := #in~cond; {4623#false} is VALID [2022-04-28 10:28:16,674 INFO L272 TraceCheckUtils]: 24: Hoare triple {4623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4623#false} is VALID [2022-04-28 10:28:16,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {4739#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {4623#false} is VALID [2022-04-28 10:28:16,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {4743#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4739#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:16,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4743#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:16,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4747#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:16,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4751#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:16,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {4759#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4755#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:16,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {4763#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4759#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:16,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {4767#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4763#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:16,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {4771#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4767#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:16,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4771#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:16,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4775#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:16,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {4783#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4779#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:16,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {4787#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4783#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:16,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {4791#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4787#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:16,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {4795#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4791#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:16,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {4799#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4795#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:16,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {4803#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4799#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:16,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {4807#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4803#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:16,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {4811#(< 17 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4807#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:28:16,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {4811#(< 17 ~SIZE~0)} call #t~ret4 := main(); {4811#(< 17 ~SIZE~0)} is VALID [2022-04-28 10:28:16,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4811#(< 17 ~SIZE~0)} {4622#true} #45#return; {4811#(< 17 ~SIZE~0)} is VALID [2022-04-28 10:28:16,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {4811#(< 17 ~SIZE~0)} assume true; {4811#(< 17 ~SIZE~0)} is VALID [2022-04-28 10:28:16,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4811#(< 17 ~SIZE~0)} is VALID [2022-04-28 10:28:16,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {4622#true} call ULTIMATE.init(); {4622#true} is VALID [2022-04-28 10:28:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:16,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292917121] [2022-04-28 10:28:16,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985959584] [2022-04-28 10:28:16,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985959584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:16,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:16,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-28 10:28:16,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:16,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478390201] [2022-04-28 10:28:16,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478390201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:16,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:16,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:28:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978373499] [2022-04-28 10:28:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:28:16,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:16,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:16,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:16,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:28:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:28:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:28:16,710 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:25,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:28:27,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:28:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:27,386 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:28:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:28:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:28:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 10:28:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 10:28:27,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-28 10:28:27,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:27,421 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:28:27,421 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:28:27,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:28:27,422 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:27,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 10:28:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:28:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:28:27,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:27,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,449 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,449 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:27,450 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:28:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:28:27,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:27,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:27,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:28:27,450 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:28:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:27,451 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:28:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:28:27,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:27,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:27,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:27,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 10:28:27,452 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-28 10:28:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 10:28:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:27,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 10:28:27,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:28:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:28:27,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:27,474 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:27,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 10:28:27,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:28:27,691 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1650803595, now seen corresponding path program 35 times [2022-04-28 10:28:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:27,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456493657] [2022-04-28 10:28:27,694 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:27,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1650803595, now seen corresponding path program 36 times [2022-04-28 10:28:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:27,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039894244] [2022-04-28 10:28:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:27,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:27,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796616537] [2022-04-28 10:28:27,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:28:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:27,715 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-04-28 10:28:27,739 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-04-28 10:28:27,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:28:27,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:27,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:28:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:27,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:28,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {5019#true} call ULTIMATE.init(); {5019#true} is VALID [2022-04-28 10:28:28,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {5019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:28,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {5027#(<= 40000 ~SIZE~0)} assume true; {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:28,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5027#(<= 40000 ~SIZE~0)} {5019#true} #45#return; {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:28,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {5027#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:28,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {5027#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5040#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5044#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {5044#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5048#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:28,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {5048#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:28,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {5052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:28,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {5056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5060#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {5060#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:28,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {5064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5068#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {5068#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5072#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:28,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {5072#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:28,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {5076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5080#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:28,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {5084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5088#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:28,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {5088#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5092#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {5092#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5096#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {5096#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5100#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {5100#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5104#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {5104#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5108#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:28,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {5108#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5112#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:28,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {5112#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {5020#false} is VALID [2022-04-28 10:28:28,348 INFO L272 TraceCheckUtils]: 25: Hoare triple {5020#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5020#false} is VALID [2022-04-28 10:28:28,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {5020#false} ~cond := #in~cond; {5020#false} is VALID [2022-04-28 10:28:28,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {5020#false} assume 0 == ~cond; {5020#false} is VALID [2022-04-28 10:28:28,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {5020#false} assume !false; {5020#false} is VALID [2022-04-28 10:28:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:28,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:29,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {5020#false} assume !false; {5020#false} is VALID [2022-04-28 10:28:29,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {5020#false} assume 0 == ~cond; {5020#false} is VALID [2022-04-28 10:28:29,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {5020#false} ~cond := #in~cond; {5020#false} is VALID [2022-04-28 10:28:29,150 INFO L272 TraceCheckUtils]: 25: Hoare triple {5020#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5020#false} is VALID [2022-04-28 10:28:29,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {5140#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {5020#false} is VALID [2022-04-28 10:28:29,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {5144#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5140#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:29,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5144#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:29,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {5152#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5148#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:29,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {5156#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5152#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:29,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {5160#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5156#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:29,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {5164#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5160#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:29,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {5168#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5164#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:29,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5172#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5168#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:29,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {5176#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5172#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:29,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {5180#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5176#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:29,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {5184#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5180#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:29,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {5188#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5184#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:29,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {5192#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5188#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:29,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {5196#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5192#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:29,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {5200#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5196#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:29,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5200#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:29,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {5208#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5204#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:29,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {5212#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5208#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:28:29,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {5216#(< 18 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5212#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:28:29,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {5216#(< 18 ~SIZE~0)} call #t~ret4 := main(); {5216#(< 18 ~SIZE~0)} is VALID [2022-04-28 10:28:29,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5216#(< 18 ~SIZE~0)} {5019#true} #45#return; {5216#(< 18 ~SIZE~0)} is VALID [2022-04-28 10:28:29,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {5216#(< 18 ~SIZE~0)} assume true; {5216#(< 18 ~SIZE~0)} is VALID [2022-04-28 10:28:29,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {5019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5216#(< 18 ~SIZE~0)} is VALID [2022-04-28 10:28:29,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {5019#true} call ULTIMATE.init(); {5019#true} is VALID [2022-04-28 10:28:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:29,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039894244] [2022-04-28 10:28:29,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:29,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796616537] [2022-04-28 10:28:29,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796616537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:29,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:29,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-28 10:28:29,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:29,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456493657] [2022-04-28 10:28:29,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456493657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:29,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:29,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:28:29,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862046978] [2022-04-28 10:28:29,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:28:29,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:29,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:29,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:29,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:28:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:28:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:28:29,187 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:31,296 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:28:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:28:31,297 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:28:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 10:28:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 10:28:31,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-28 10:28:31,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:31,323 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:28:31,323 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 10:28:31,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:28:31,324 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:31,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:28:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 10:28:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 10:28:31,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:31,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,355 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,355 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:31,355 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:28:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:28:31,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:31,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:31,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:28:31,356 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:28:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:31,356 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:28:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:28:31,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:31,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:31,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:31,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 10:28:31,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-28 10:28:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:31,358 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 10:28:31,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:31,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 10:28:31,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:28:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:28:31,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:31,383 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:31,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 10:28:31,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:31,584 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -330201038, now seen corresponding path program 37 times [2022-04-28 10:28:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:31,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1858730429] [2022-04-28 10:28:31,590 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:31,590 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash -330201038, now seen corresponding path program 38 times [2022-04-28 10:28:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:31,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670795007] [2022-04-28 10:28:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:31,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:31,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763075487] [2022-04-28 10:28:31,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:28:31,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:31,608 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-04-28 10:28:31,646 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-04-28 10:28:31,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:28:31,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:31,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:28:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:31,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:32,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2022-04-28 10:28:32,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {5430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:32,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {5438#(<= 40000 ~SIZE~0)} assume true; {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:32,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5438#(<= 40000 ~SIZE~0)} {5430#true} #45#return; {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:32,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {5438#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:32,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {5438#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5451#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {5451#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5455#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {5455#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:32,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {5459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5463#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:32,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {5463#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:32,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5471#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {5471#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5475#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:32,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {5475#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5479#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {5479#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:32,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {5483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:32,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {5487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5491#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {5491#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5495#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:32,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {5495#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:32,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5503#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {5503#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5507#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {5507#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5511#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {5511#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5515#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {5515#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:32,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {5519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5523#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:32,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {5523#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:28:32,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {5527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !(~i~0 < ~SIZE~0); {5431#false} is VALID [2022-04-28 10:28:32,294 INFO L272 TraceCheckUtils]: 26: Hoare triple {5431#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5431#false} is VALID [2022-04-28 10:28:32,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#false} ~cond := #in~cond; {5431#false} is VALID [2022-04-28 10:28:32,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {5431#false} assume 0 == ~cond; {5431#false} is VALID [2022-04-28 10:28:32,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-28 10:28:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:32,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:33,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-28 10:28:33,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {5431#false} assume 0 == ~cond; {5431#false} is VALID [2022-04-28 10:28:33,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#false} ~cond := #in~cond; {5431#false} is VALID [2022-04-28 10:28:33,131 INFO L272 TraceCheckUtils]: 26: Hoare triple {5431#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5431#false} is VALID [2022-04-28 10:28:33,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {5555#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {5431#false} is VALID [2022-04-28 10:28:33,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {5559#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5555#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:33,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {5563#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5559#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:33,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {5567#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5563#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:33,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5567#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:33,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {5575#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5571#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:33,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {5579#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5575#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:33,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {5583#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5579#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:33,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5583#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:33,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {5591#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5587#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:33,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {5595#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5591#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:33,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5595#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:33,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5599#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:33,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {5607#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5603#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:33,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {5611#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5607#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:33,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {5615#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5611#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:33,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {5619#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5615#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:33,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {5623#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5619#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:33,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {5627#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5623#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:28:33,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {5631#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5627#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:28:33,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {5635#(< 19 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5631#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:33,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {5635#(< 19 ~SIZE~0)} call #t~ret4 := main(); {5635#(< 19 ~SIZE~0)} is VALID [2022-04-28 10:28:33,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5635#(< 19 ~SIZE~0)} {5430#true} #45#return; {5635#(< 19 ~SIZE~0)} is VALID [2022-04-28 10:28:33,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {5635#(< 19 ~SIZE~0)} assume true; {5635#(< 19 ~SIZE~0)} is VALID [2022-04-28 10:28:33,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {5430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5635#(< 19 ~SIZE~0)} is VALID [2022-04-28 10:28:33,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2022-04-28 10:28:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670795007] [2022-04-28 10:28:33,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763075487] [2022-04-28 10:28:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763075487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:33,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:33,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-28 10:28:33,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:33,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1858730429] [2022-04-28 10:28:33,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1858730429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:33,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:33,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:28:33,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073130095] [2022-04-28 10:28:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:28:33,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:33,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:33,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:33,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:28:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:28:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:28:33,170 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:37,372 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:28:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:28:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:28:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 10:28:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 10:28:37,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-28 10:28:37,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:37,408 INFO L225 Difference]: With dead ends: 37 [2022-04-28 10:28:37,408 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:28:37,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:28:37,409 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:37,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:28:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:28:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:28:37,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:37,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,442 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,442 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:37,443 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:28:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:28:37,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:37,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:37,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:28:37,444 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:28:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:37,444 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:28:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:28:37,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:37,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:37,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:37,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 10:28:37,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-28 10:28:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:37,446 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 10:28:37,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:37,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 10:28:37,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:28:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:28:37,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:37,476 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:37,501 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-04-28 10:28:37,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:37,677 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1611802517, now seen corresponding path program 39 times [2022-04-28 10:28:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:37,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050794362] [2022-04-28 10:28:37,680 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:37,680 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1611802517, now seen corresponding path program 40 times [2022-04-28 10:28:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:37,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679625318] [2022-04-28 10:28:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:37,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:37,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533034984] [2022-04-28 10:28:37,694 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:28:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:37,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:37,695 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-04-28 10:28:37,710 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-04-28 10:28:37,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:28:37,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:37,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:28:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:37,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:38,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {5855#true} call ULTIMATE.init(); {5855#true} is VALID [2022-04-28 10:28:38,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {5855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:38,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {5863#(<= 40000 ~SIZE~0)} assume true; {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:38,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5863#(<= 40000 ~SIZE~0)} {5855#true} #45#return; {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:38,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {5863#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:38,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {5863#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5876#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {5876#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5880#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {5880#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:38,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {5884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:38,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {5888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:38,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {5892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5896#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {5896#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:38,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {5900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5904#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {5904#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:38,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {5908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:38,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {5912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5916#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {5916#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:38,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {5920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:38,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {5924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5928#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {5928#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5932#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {5932#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5936#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {5936#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5940#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {5940#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:38,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5948#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:38,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {5948#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:28:38,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {5952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:28:38,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {5956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !(~i~0 < ~SIZE~0); {5856#false} is VALID [2022-04-28 10:28:38,412 INFO L272 TraceCheckUtils]: 27: Hoare triple {5856#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5856#false} is VALID [2022-04-28 10:28:38,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {5856#false} ~cond := #in~cond; {5856#false} is VALID [2022-04-28 10:28:38,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {5856#false} assume 0 == ~cond; {5856#false} is VALID [2022-04-28 10:28:38,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {5856#false} assume !false; {5856#false} is VALID [2022-04-28 10:28:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:38,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:39,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {5856#false} assume !false; {5856#false} is VALID [2022-04-28 10:28:39,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {5856#false} assume 0 == ~cond; {5856#false} is VALID [2022-04-28 10:28:39,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {5856#false} ~cond := #in~cond; {5856#false} is VALID [2022-04-28 10:28:39,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {5856#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5856#false} is VALID [2022-04-28 10:28:39,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {5984#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {5856#false} is VALID [2022-04-28 10:28:39,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {5988#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5984#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:39,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {5992#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5988#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:39,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {5996#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5992#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:39,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {6000#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5996#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:39,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {6004#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6000#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:39,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {6008#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6004#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:39,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {6012#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6008#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:39,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {6016#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6012#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:39,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {6020#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6016#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:39,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {6024#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6020#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:39,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {6028#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6024#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:39,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {6032#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6028#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:39,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {6036#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6032#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:39,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {6040#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6036#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:39,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6040#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:39,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {6048#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6044#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:39,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6048#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:39,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {6056#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6052#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:28:39,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {6060#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6056#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:28:39,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {6064#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6060#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:39,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {6068#(< 20 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6064#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:28:39,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {6068#(< 20 ~SIZE~0)} call #t~ret4 := main(); {6068#(< 20 ~SIZE~0)} is VALID [2022-04-28 10:28:39,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6068#(< 20 ~SIZE~0)} {5855#true} #45#return; {6068#(< 20 ~SIZE~0)} is VALID [2022-04-28 10:28:39,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {6068#(< 20 ~SIZE~0)} assume true; {6068#(< 20 ~SIZE~0)} is VALID [2022-04-28 10:28:39,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {5855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6068#(< 20 ~SIZE~0)} is VALID [2022-04-28 10:28:39,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {5855#true} call ULTIMATE.init(); {5855#true} is VALID [2022-04-28 10:28:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:39,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679625318] [2022-04-28 10:28:39,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:39,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533034984] [2022-04-28 10:28:39,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533034984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:39,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:39,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-28 10:28:39,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050794362] [2022-04-28 10:28:39,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050794362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:39,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:39,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:28:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999619691] [2022-04-28 10:28:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:28:39,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:39,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:39,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:39,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:28:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:28:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:28:39,434 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:43,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:28:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:45,658 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:28:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:28:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:28:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 10:28:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 10:28:45,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-28 10:28:45,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:45,691 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:28:45,692 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:28:45,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:28:45,693 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:45,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:28:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:28:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 10:28:45,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:45,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,720 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,720 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:45,721 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:28:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:28:45,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:45,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:45,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:28:45,722 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:28:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:45,722 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:28:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:28:45,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:45,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:45,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:45,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 10:28:45,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-28 10:28:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:45,724 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 10:28:45,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:45,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 10:28:45,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:28:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:28:45,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:45,749 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:45,766 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-04-28 10:28:45,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:45,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:45,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1608224594, now seen corresponding path program 41 times [2022-04-28 10:28:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:45,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993286792] [2022-04-28 10:28:45,953 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:45,953 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1608224594, now seen corresponding path program 42 times [2022-04-28 10:28:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:45,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603529256] [2022-04-28 10:28:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:45,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:45,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381521159] [2022-04-28 10:28:45,969 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:28:45,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:45,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:45,970 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-04-28 10:28:45,975 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-04-28 10:28:46,020 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:28:46,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:46,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:28:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:46,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:46,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6294#true} is VALID [2022-04-28 10:28:46,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {6294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:46,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {6302#(<= 40000 ~SIZE~0)} assume true; {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:46,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6302#(<= 40000 ~SIZE~0)} {6294#true} #45#return; {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:46,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {6302#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:46,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {6302#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6315#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {6315#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6319#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {6319#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:46,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {6323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:46,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {6327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:46,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {6331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6335#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {6335#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:46,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {6339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6343#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:46,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {6347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6351#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:46,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {6351#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6355#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {6355#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:46,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {6359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:46,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {6363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6367#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {6367#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6371#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {6371#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6375#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {6375#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6379#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {6379#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:46,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {6383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6387#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {6387#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:28:46,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {6391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6395#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:28:46,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {6395#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6399#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:46,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {6399#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {6295#false} is VALID [2022-04-28 10:28:46,644 INFO L272 TraceCheckUtils]: 28: Hoare triple {6295#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6295#false} is VALID [2022-04-28 10:28:46,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {6295#false} ~cond := #in~cond; {6295#false} is VALID [2022-04-28 10:28:46,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#false} assume 0 == ~cond; {6295#false} is VALID [2022-04-28 10:28:46,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2022-04-28 10:28:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:46,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:47,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2022-04-28 10:28:47,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#false} assume 0 == ~cond; {6295#false} is VALID [2022-04-28 10:28:47,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {6295#false} ~cond := #in~cond; {6295#false} is VALID [2022-04-28 10:28:47,672 INFO L272 TraceCheckUtils]: 28: Hoare triple {6295#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6295#false} is VALID [2022-04-28 10:28:47,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {6427#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {6295#false} is VALID [2022-04-28 10:28:47,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {6431#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6427#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:47,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {6435#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6431#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:47,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {6439#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6435#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:47,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {6443#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6439#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:47,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {6447#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6443#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:47,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {6451#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6447#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:47,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {6455#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6451#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:47,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {6459#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6455#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:47,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {6463#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6459#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:47,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {6467#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6463#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:47,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {6471#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6467#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:47,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {6475#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6471#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:47,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {6479#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6475#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:47,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {6483#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6479#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:47,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {6487#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6483#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:47,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {6491#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6487#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:47,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {6495#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6491#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:47,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {6499#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6495#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:28:47,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6499#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:28:47,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {6507#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6503#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:47,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {6511#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6507#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:28:47,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {6515#(< 21 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6511#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:28:47,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {6515#(< 21 ~SIZE~0)} call #t~ret4 := main(); {6515#(< 21 ~SIZE~0)} is VALID [2022-04-28 10:28:47,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6515#(< 21 ~SIZE~0)} {6294#true} #45#return; {6515#(< 21 ~SIZE~0)} is VALID [2022-04-28 10:28:47,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {6515#(< 21 ~SIZE~0)} assume true; {6515#(< 21 ~SIZE~0)} is VALID [2022-04-28 10:28:47,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {6294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6515#(< 21 ~SIZE~0)} is VALID [2022-04-28 10:28:47,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6294#true} is VALID [2022-04-28 10:28:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:47,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:47,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603529256] [2022-04-28 10:28:47,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:47,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381521159] [2022-04-28 10:28:47,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381521159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:47,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:47,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-28 10:28:47,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993286792] [2022-04-28 10:28:47,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993286792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:47,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:47,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:28:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007743884] [2022-04-28 10:28:47,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:28:47,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:47,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:47,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:47,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:28:47,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:47,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:28:47,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:28:47,713 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:52,413 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:28:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:28:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:28:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 10:28:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 10:28:52,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-28 10:28:52,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:52,455 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:28:52,455 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:28:52,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:28:52,456 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:52,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:28:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:28:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 10:28:52,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:52,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,488 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,488 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:52,489 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:28:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:28:52,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:52,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:52,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:28:52,489 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:28:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:52,490 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:28:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:28:52,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:52,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:52,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:52,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 10:28:52,491 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-28 10:28:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:52,491 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 10:28:52,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:52,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 10:28:52,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:28:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:28:52,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:52,519 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:52,535 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-04-28 10:28:52,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:52,720 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1650150069, now seen corresponding path program 43 times [2022-04-28 10:28:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:52,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390945102] [2022-04-28 10:28:52,722 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:52,723 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1650150069, now seen corresponding path program 44 times [2022-04-28 10:28:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:52,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099753910] [2022-04-28 10:28:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:52,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:52,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958473131] [2022-04-28 10:28:52,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:28:52,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:52,739 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-04-28 10:28:52,742 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-04-28 10:28:52,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:28:52,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:52,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:28:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:52,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:53,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {6747#true} call ULTIMATE.init(); {6747#true} is VALID [2022-04-28 10:28:53,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:53,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {6755#(<= 40000 ~SIZE~0)} assume true; {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:53,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6755#(<= 40000 ~SIZE~0)} {6747#true} #45#return; {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:53,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {6755#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:53,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {6755#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {6768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {6772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:53,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:53,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {6780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:53,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {6784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {6788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:53,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {6792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {6796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:53,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {6800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:53,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {6804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {6808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:53,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {6812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:53,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {6816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {6820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {6824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {6828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {6832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:53,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {6836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {6840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:28:53,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {6844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:28:53,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {6848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:53,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {6852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:28:53,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {6856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !(~i~0 < ~SIZE~0); {6748#false} is VALID [2022-04-28 10:28:53,445 INFO L272 TraceCheckUtils]: 29: Hoare triple {6748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6748#false} is VALID [2022-04-28 10:28:53,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {6748#false} ~cond := #in~cond; {6748#false} is VALID [2022-04-28 10:28:53,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {6748#false} assume 0 == ~cond; {6748#false} is VALID [2022-04-28 10:28:53,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {6748#false} assume !false; {6748#false} is VALID [2022-04-28 10:28:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:53,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:54,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {6748#false} assume !false; {6748#false} is VALID [2022-04-28 10:28:54,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {6748#false} assume 0 == ~cond; {6748#false} is VALID [2022-04-28 10:28:54,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {6748#false} ~cond := #in~cond; {6748#false} is VALID [2022-04-28 10:28:54,556 INFO L272 TraceCheckUtils]: 29: Hoare triple {6748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6748#false} is VALID [2022-04-28 10:28:54,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {6884#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {6748#false} is VALID [2022-04-28 10:28:54,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {6888#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6884#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:28:54,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {6892#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6888#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:28:54,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {6896#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6892#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:28:54,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {6900#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6896#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:28:54,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {6904#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6900#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:28:54,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {6908#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6904#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:54,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {6912#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6908#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:28:54,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {6916#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6912#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:54,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {6920#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6916#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:28:54,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {6924#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6920#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:28:54,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {6928#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6924#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:28:54,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {6932#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6928#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:28:54,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {6936#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6932#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:28:54,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {6940#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6936#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:28:54,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {6944#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6940#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:28:54,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {6948#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6944#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:28:54,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {6952#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6948#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:28:54,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {6956#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6952#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:28:54,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {6960#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6956#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:28:54,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {6964#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6960#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:28:54,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {6968#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6964#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:28:54,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {6972#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6968#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:28:54,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {6976#(< 22 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6972#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:28:54,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {6976#(< 22 ~SIZE~0)} call #t~ret4 := main(); {6976#(< 22 ~SIZE~0)} is VALID [2022-04-28 10:28:54,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6976#(< 22 ~SIZE~0)} {6747#true} #45#return; {6976#(< 22 ~SIZE~0)} is VALID [2022-04-28 10:28:54,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {6976#(< 22 ~SIZE~0)} assume true; {6976#(< 22 ~SIZE~0)} is VALID [2022-04-28 10:28:54,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6976#(< 22 ~SIZE~0)} is VALID [2022-04-28 10:28:54,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {6747#true} call ULTIMATE.init(); {6747#true} is VALID [2022-04-28 10:28:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099753910] [2022-04-28 10:28:54,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:28:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958473131] [2022-04-28 10:28:54,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958473131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:28:54,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-28 10:28:54,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390945102] [2022-04-28 10:28:54,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390945102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:54,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:28:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859756170] [2022-04-28 10:28:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:28:54,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:54,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:54,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:54,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:28:54,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:28:54,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:28:54,597 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:58,744 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:28:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:28:58,744 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:28:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 10:28:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 10:28:58,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-28 10:28:58,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:58,774 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:28:58,774 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:28:58,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:28:58,775 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:58,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:28:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:28:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 10:28:58,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:58,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,803 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,803 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:58,804 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:28:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:28:58,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:58,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:58,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 10:28:58,804 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 10:28:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:58,805 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:28:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:28:58,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:58,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:58,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:58,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 10:28:58,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-28 10:28:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:58,806 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 10:28:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:58,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 10:28:58,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 10:28:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:28:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:58,832 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:58,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 10:28:59,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:59,033 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 419450482, now seen corresponding path program 45 times [2022-04-28 10:28:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:59,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317950350] [2022-04-28 10:28:59,035 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:59,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 419450482, now seen corresponding path program 46 times [2022-04-28 10:28:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:59,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886779152] [2022-04-28 10:28:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:59,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:28:59,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470542585] [2022-04-28 10:28:59,051 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:28:59,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:59,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:59,052 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-04-28 10:28:59,056 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-04-28 10:28:59,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:28:59,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:59,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:28:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:59,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:59,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {7214#true} call ULTIMATE.init(); {7214#true} is VALID [2022-04-28 10:28:59,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {7214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:59,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {7222#(<= 40000 ~SIZE~0)} assume true; {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:59,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7222#(<= 40000 ~SIZE~0)} {7214#true} #45#return; {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:59,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {7222#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:28:59,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {7222#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7235#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {7235#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7239#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {7239#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:28:59,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {7243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:28:59,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {7247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:28:59,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {7251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7255#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {7255#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:28:59,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {7259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7263#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {7263#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:28:59,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {7267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7271#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:28:59,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {7271#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7275#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {7275#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:28:59,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {7279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7283#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:28:59,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {7283#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7287#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {7287#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7291#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {7291#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7295#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {7295#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7299#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {7299#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:28:59,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {7303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7307#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {7307#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:28:59,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {7311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7315#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:28:59,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {7315#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7319#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:28:59,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {7319#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:28:59,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {7323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:28:59,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {7327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !(~i~0 < ~SIZE~0); {7215#false} is VALID [2022-04-28 10:28:59,781 INFO L272 TraceCheckUtils]: 30: Hoare triple {7215#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7215#false} is VALID [2022-04-28 10:28:59,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {7215#false} ~cond := #in~cond; {7215#false} is VALID [2022-04-28 10:28:59,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {7215#false} assume 0 == ~cond; {7215#false} is VALID [2022-04-28 10:28:59,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {7215#false} assume !false; {7215#false} is VALID [2022-04-28 10:28:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:59,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:01,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {7215#false} assume !false; {7215#false} is VALID [2022-04-28 10:29:01,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {7215#false} assume 0 == ~cond; {7215#false} is VALID [2022-04-28 10:29:01,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {7215#false} ~cond := #in~cond; {7215#false} is VALID [2022-04-28 10:29:01,019 INFO L272 TraceCheckUtils]: 30: Hoare triple {7215#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7215#false} is VALID [2022-04-28 10:29:01,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {7355#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {7215#false} is VALID [2022-04-28 10:29:01,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {7359#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7355#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:01,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {7363#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7359#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:01,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {7367#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7363#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:01,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {7371#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7367#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:01,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {7375#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7371#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:01,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {7379#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7375#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:01,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {7383#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7379#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:01,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {7387#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7383#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:01,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {7391#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7387#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:01,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7391#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:01,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {7399#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7395#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:01,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {7403#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7399#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:01,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7403#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:01,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {7411#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7407#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:01,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {7415#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7411#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:01,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {7419#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7415#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:01,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {7423#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7419#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:01,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {7427#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7423#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:01,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {7431#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7427#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:01,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {7435#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7431#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:01,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {7439#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7435#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:01,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {7443#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7439#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:01,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {7447#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7443#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:01,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#(< 23 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7447#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:01,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#(< 23 ~SIZE~0)} call #t~ret4 := main(); {7451#(< 23 ~SIZE~0)} is VALID [2022-04-28 10:29:01,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#(< 23 ~SIZE~0)} {7214#true} #45#return; {7451#(< 23 ~SIZE~0)} is VALID [2022-04-28 10:29:01,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#(< 23 ~SIZE~0)} assume true; {7451#(< 23 ~SIZE~0)} is VALID [2022-04-28 10:29:01,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {7214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7451#(< 23 ~SIZE~0)} is VALID [2022-04-28 10:29:01,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {7214#true} call ULTIMATE.init(); {7214#true} is VALID [2022-04-28 10:29:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886779152] [2022-04-28 10:29:01,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:01,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470542585] [2022-04-28 10:29:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470542585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:01,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:01,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2022-04-28 10:29:01,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:01,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317950350] [2022-04-28 10:29:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317950350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:01,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:01,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:29:01,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571545835] [2022-04-28 10:29:01,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:01,039 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 10:29:01,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:01,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:01,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:29:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:29:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:29:01,067 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:09,277 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 10:29:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:29:09,278 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 10:29:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 10:29:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 10:29:09,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-28 10:29:09,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:09,317 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:29:09,317 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:29:09,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:29:09,318 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:09,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:29:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:29:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 10:29:09,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:09,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,345 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,345 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:09,345 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:29:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:29:09,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:09,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:09,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:29:09,346 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:29:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:09,347 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:29:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:29:09,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:09,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:09,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:09,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 10:29:09,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-28 10:29:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:09,348 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 10:29:09,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 10:29:09,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 10:29:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:29:09,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:09,381 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:09,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:09,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:09,590 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 152558123, now seen corresponding path program 47 times [2022-04-28 10:29:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982330639] [2022-04-28 10:29:09,594 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:09,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash 152558123, now seen corresponding path program 48 times [2022-04-28 10:29:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:09,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838346908] [2022-04-28 10:29:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:09,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:29:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592130749] [2022-04-28 10:29:09,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:29:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:09,609 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:09,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 10:29:09,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 10:29:09,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:09,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:29:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:09,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:10,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {7695#true} call ULTIMATE.init(); {7695#true} is VALID [2022-04-28 10:29:10,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {7695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:10,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {7703#(<= 40000 ~SIZE~0)} assume true; {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:10,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7703#(<= 40000 ~SIZE~0)} {7695#true} #45#return; {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:10,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {7703#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:10,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {7703#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7716#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {7716#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7720#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {7720#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:29:10,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {7724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:29:10,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {7728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:29:10,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {7732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7736#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {7736#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7740#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:29:10,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {7740#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7744#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {7744#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7748#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:29:10,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {7748#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:29:10,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {7752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7756#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {7756#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7760#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:29:10,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {7760#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:29:10,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {7764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7768#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {7768#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7772#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {7772#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7776#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {7776#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7780#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {7780#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:29:10,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {7784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7788#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {7788#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:29:10,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {7792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:29:10,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {7796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7800#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:10,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {7800#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:29:10,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {7804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:29:10,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {7808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:29:10,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {7812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !(~i~0 < ~SIZE~0); {7696#false} is VALID [2022-04-28 10:29:10,372 INFO L272 TraceCheckUtils]: 31: Hoare triple {7696#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7696#false} is VALID [2022-04-28 10:29:10,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {7696#false} ~cond := #in~cond; {7696#false} is VALID [2022-04-28 10:29:10,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {7696#false} assume 0 == ~cond; {7696#false} is VALID [2022-04-28 10:29:10,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {7696#false} assume !false; {7696#false} is VALID [2022-04-28 10:29:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:10,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:11,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {7696#false} assume !false; {7696#false} is VALID [2022-04-28 10:29:11,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {7696#false} assume 0 == ~cond; {7696#false} is VALID [2022-04-28 10:29:11,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {7696#false} ~cond := #in~cond; {7696#false} is VALID [2022-04-28 10:29:11,833 INFO L272 TraceCheckUtils]: 31: Hoare triple {7696#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7696#false} is VALID [2022-04-28 10:29:11,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {7840#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {7696#false} is VALID [2022-04-28 10:29:11,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {7844#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7840#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:11,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {7848#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7844#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:11,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {7852#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7848#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:11,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {7856#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7852#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:11,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {7860#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7856#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:11,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {7864#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7860#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:11,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {7868#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7864#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:11,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {7872#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7868#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:11,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {7876#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7872#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:11,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {7880#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7876#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:11,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {7884#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7880#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:11,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {7888#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7884#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:11,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {7892#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7888#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:11,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {7896#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7892#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:11,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {7900#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7896#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:11,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {7904#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7900#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:11,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {7908#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7904#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:11,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {7912#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7908#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:11,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {7916#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7912#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:11,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {7920#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7916#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:11,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {7924#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7920#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:11,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {7928#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7924#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:11,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {7932#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7928#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:11,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {7936#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7932#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:11,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {7940#(< 24 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7936#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:29:11,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {7940#(< 24 ~SIZE~0)} call #t~ret4 := main(); {7940#(< 24 ~SIZE~0)} is VALID [2022-04-28 10:29:11,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7940#(< 24 ~SIZE~0)} {7695#true} #45#return; {7940#(< 24 ~SIZE~0)} is VALID [2022-04-28 10:29:11,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {7940#(< 24 ~SIZE~0)} assume true; {7940#(< 24 ~SIZE~0)} is VALID [2022-04-28 10:29:11,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {7695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7940#(< 24 ~SIZE~0)} is VALID [2022-04-28 10:29:11,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {7695#true} call ULTIMATE.init(); {7695#true} is VALID [2022-04-28 10:29:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:11,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838346908] [2022-04-28 10:29:11,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:11,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592130749] [2022-04-28 10:29:11,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592130749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:11,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:11,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2022-04-28 10:29:11,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:11,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982330639] [2022-04-28 10:29:11,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982330639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:11,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:11,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:29:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253820494] [2022-04-28 10:29:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:11,868 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 10:29:11,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:11,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:11,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:11,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:29:11,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:11,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:29:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:29:11,895 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:19,295 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 10:29:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:29:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 10:29:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 10:29:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 10:29:19,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-28 10:29:19,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:19,349 INFO L225 Difference]: With dead ends: 42 [2022-04-28 10:29:19,350 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:29:19,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:29:19,351 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:19,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:29:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:29:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 10:29:19,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:19,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,378 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,378 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:19,379 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:29:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 10:29:19,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:19,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:19,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 10:29:19,379 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 10:29:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:19,380 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:29:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 10:29:19,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:19,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:19,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:19,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 10:29:19,381 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-28 10:29:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:19,381 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 10:29:19,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:19,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 10:29:19,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 10:29:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:29:19,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:19,411 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:19,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:19,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 10:29:19,611 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash 468829586, now seen corresponding path program 49 times [2022-04-28 10:29:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:19,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [793455050] [2022-04-28 10:29:19,614 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:19,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 468829586, now seen corresponding path program 50 times [2022-04-28 10:29:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:19,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634433388] [2022-04-28 10:29:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:19,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:29:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363901724] [2022-04-28 10:29:19,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:29:19,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:19,633 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:19,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 10:29:19,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:29:19,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:19,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:29:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:19,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:20,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {8190#true} call ULTIMATE.init(); {8190#true} is VALID [2022-04-28 10:29:20,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {8190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:20,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {8198#(<= 40000 ~SIZE~0)} assume true; {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:20,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8198#(<= 40000 ~SIZE~0)} {8190#true} #45#return; {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:20,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {8198#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:20,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {8198#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8211#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {8211#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8215#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {8215#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:29:20,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {8219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:29:20,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {8223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:29:20,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {8227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8231#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {8231#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8235#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:29:20,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {8235#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8239#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {8239#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:29:20,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {8243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:29:20,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {8247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8251#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {8251#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:29:20,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {8255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:29:20,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {8259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8263#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8267#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {8267#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8271#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {8271#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8275#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {8275#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:29:20,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {8279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8283#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:29:20,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {8287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:29:20,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {8291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8295#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:20,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {8295#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8299#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:29:20,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {8299#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:29:20,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {8303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8307#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:29:20,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {8307#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:29:20,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {8311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !(~i~0 < ~SIZE~0); {8191#false} is VALID [2022-04-28 10:29:20,429 INFO L272 TraceCheckUtils]: 32: Hoare triple {8191#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8191#false} is VALID [2022-04-28 10:29:20,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {8191#false} ~cond := #in~cond; {8191#false} is VALID [2022-04-28 10:29:20,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {8191#false} assume 0 == ~cond; {8191#false} is VALID [2022-04-28 10:29:20,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {8191#false} assume !false; {8191#false} is VALID [2022-04-28 10:29:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:20,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:21,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {8191#false} assume !false; {8191#false} is VALID [2022-04-28 10:29:21,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {8191#false} assume 0 == ~cond; {8191#false} is VALID [2022-04-28 10:29:21,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {8191#false} ~cond := #in~cond; {8191#false} is VALID [2022-04-28 10:29:21,976 INFO L272 TraceCheckUtils]: 32: Hoare triple {8191#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8191#false} is VALID [2022-04-28 10:29:21,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {8339#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {8191#false} is VALID [2022-04-28 10:29:21,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {8343#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8339#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:21,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {8347#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8343#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:21,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {8351#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8347#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:21,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {8355#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8351#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:21,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {8359#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8355#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:21,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {8363#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8359#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:21,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {8367#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8363#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:21,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {8371#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8367#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:21,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {8375#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8371#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:21,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {8379#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8375#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:21,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {8383#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8379#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:21,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {8387#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8383#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:21,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {8391#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8387#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:21,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {8395#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8391#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:21,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {8399#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8395#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:21,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {8403#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8399#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:21,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {8407#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8403#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:21,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {8411#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8407#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:21,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {8415#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8411#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:21,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {8419#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8415#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:21,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {8423#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8419#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:21,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {8427#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8423#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:21,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {8431#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8427#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:21,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8431#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:21,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {8439#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8435#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:29:21,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {8443#(< 25 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8439#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:29:21,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {8443#(< 25 ~SIZE~0)} call #t~ret4 := main(); {8443#(< 25 ~SIZE~0)} is VALID [2022-04-28 10:29:21,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8443#(< 25 ~SIZE~0)} {8190#true} #45#return; {8443#(< 25 ~SIZE~0)} is VALID [2022-04-28 10:29:21,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {8443#(< 25 ~SIZE~0)} assume true; {8443#(< 25 ~SIZE~0)} is VALID [2022-04-28 10:29:21,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {8190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8443#(< 25 ~SIZE~0)} is VALID [2022-04-28 10:29:21,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {8190#true} call ULTIMATE.init(); {8190#true} is VALID [2022-04-28 10:29:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:21,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634433388] [2022-04-28 10:29:21,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:21,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363901724] [2022-04-28 10:29:21,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363901724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:21,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:21,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2022-04-28 10:29:21,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [793455050] [2022-04-28 10:29:21,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [793455050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:21,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:21,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:29:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527706246] [2022-04-28 10:29:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:21,999 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 10:29:21,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:22,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:22,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:22,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:29:22,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:29:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:29:22,027 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:26,408 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 10:29:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:29:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 10:29:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 10:29:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 10:29:26,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-28 10:29:26,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:26,451 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:29:26,451 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:29:26,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:29:26,453 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:26,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:29:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:29:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 10:29:26,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:26,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,487 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,487 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:26,488 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:29:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 10:29:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:26,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:26,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 10:29:26,489 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 10:29:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:26,489 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:29:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 10:29:26,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:26,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:26,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:26,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-28 10:29:26,490 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-28 10:29:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:26,490 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-28 10:29:26,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:26,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-28 10:29:26,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 10:29:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:29:26,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:26,530 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:26,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:26,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:29:26,731 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1683310347, now seen corresponding path program 51 times [2022-04-28 10:29:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:26,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [116377272] [2022-04-28 10:29:26,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:26,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1683310347, now seen corresponding path program 52 times [2022-04-28 10:29:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:26,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4884023] [2022-04-28 10:29:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:26,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:29:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801809279] [2022-04-28 10:29:26,748 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:29:26,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:26,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:26,749 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:26,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 10:29:26,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:29:26,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:26,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:29:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:26,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:27,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {8699#true} call ULTIMATE.init(); {8699#true} is VALID [2022-04-28 10:29:27,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:27,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {8707#(<= 40000 ~SIZE~0)} assume true; {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:27,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8707#(<= 40000 ~SIZE~0)} {8699#true} #45#return; {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:27,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {8707#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:27,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {8707#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8720#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {8720#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8724#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {8724#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:29:27,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {8728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:29:27,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {8732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8736#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:29:27,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {8736#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8740#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {8740#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8744#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:29:27,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {8744#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8748#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {8748#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:29:27,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {8752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8756#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:29:27,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {8756#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8760#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {8760#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:29:27,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {8764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:29:27,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {8768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8772#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {8772#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8776#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {8776#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8780#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {8780#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8784#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {8784#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:29:27,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {8788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8792#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {8792#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:29:27,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {8796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:29:27,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {8800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8804#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:27,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {8804#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:29:27,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {8808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:29:27,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {8812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:29:27,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {8816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8820#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:29:27,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {8820#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:29:27,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {8824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !(~i~0 < ~SIZE~0); {8700#false} is VALID [2022-04-28 10:29:27,627 INFO L272 TraceCheckUtils]: 33: Hoare triple {8700#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8700#false} is VALID [2022-04-28 10:29:27,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#false} ~cond := #in~cond; {8700#false} is VALID [2022-04-28 10:29:27,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#false} assume 0 == ~cond; {8700#false} is VALID [2022-04-28 10:29:27,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {8700#false} assume !false; {8700#false} is VALID [2022-04-28 10:29:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:27,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:29,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {8700#false} assume !false; {8700#false} is VALID [2022-04-28 10:29:29,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#false} assume 0 == ~cond; {8700#false} is VALID [2022-04-28 10:29:29,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#false} ~cond := #in~cond; {8700#false} is VALID [2022-04-28 10:29:29,365 INFO L272 TraceCheckUtils]: 33: Hoare triple {8700#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8700#false} is VALID [2022-04-28 10:29:29,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {8852#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {8700#false} is VALID [2022-04-28 10:29:29,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {8856#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8852#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:29,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {8860#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8856#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:29,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {8864#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8860#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:29,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {8868#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8864#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:29,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {8872#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8868#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:29,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {8876#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8872#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:29,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {8880#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8876#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:29,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {8884#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8880#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:29,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {8888#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8884#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:29,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {8892#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8888#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:29,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {8896#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8892#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:29,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {8900#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8896#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:29,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {8904#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8900#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:29,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {8908#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8904#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:29,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {8912#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8908#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:29,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8912#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:29,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {8920#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8916#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:29,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {8924#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8920#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:29,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {8928#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8924#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:29,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {8932#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8928#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:29,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {8936#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8932#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:29,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {8940#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8936#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:29,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {8944#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8940#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:29,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {8948#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8944#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:29,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {8952#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8948#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:29:29,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8952#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:29:29,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {8960#(< 26 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8956#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:29:29,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {8960#(< 26 ~SIZE~0)} call #t~ret4 := main(); {8960#(< 26 ~SIZE~0)} is VALID [2022-04-28 10:29:29,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8960#(< 26 ~SIZE~0)} {8699#true} #45#return; {8960#(< 26 ~SIZE~0)} is VALID [2022-04-28 10:29:29,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {8960#(< 26 ~SIZE~0)} assume true; {8960#(< 26 ~SIZE~0)} is VALID [2022-04-28 10:29:29,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8960#(< 26 ~SIZE~0)} is VALID [2022-04-28 10:29:29,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {8699#true} call ULTIMATE.init(); {8699#true} is VALID [2022-04-28 10:29:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:29,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4884023] [2022-04-28 10:29:29,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:29,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801809279] [2022-04-28 10:29:29,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801809279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:29,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:29,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2022-04-28 10:29:29,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:29,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [116377272] [2022-04-28 10:29:29,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [116377272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:29,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:29,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:29:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819348376] [2022-04-28 10:29:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 10:29:29,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:29,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:29,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:29,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:29:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:29:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:29:29,416 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:33,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:35,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:35,712 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 10:29:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:29:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 10:29:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 10:29:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 10:29:35,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-28 10:29:35,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:35,751 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:29:35,751 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:29:35,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:29:35,752 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:35,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 10:29:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:29:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 10:29:35,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:35,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,784 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,784 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:35,784 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:29:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 10:29:35,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:35,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:35,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 10:29:35,785 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 10:29:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:35,786 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:29:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 10:29:35,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:35,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:35,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:35,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 10:29:35,787 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-28 10:29:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:35,787 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 10:29:35,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:35,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 10:29:35,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 10:29:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:29:35,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:35,836 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:35,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:36,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:29:36,037 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash 677508274, now seen corresponding path program 53 times [2022-04-28 10:29:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:36,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073151072] [2022-04-28 10:29:36,044 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:36,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash 677508274, now seen corresponding path program 54 times [2022-04-28 10:29:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:36,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2966921] [2022-04-28 10:29:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:36,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:29:36,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703830849] [2022-04-28 10:29:36,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:29:36,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:36,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:36,060 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:36,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 10:29:36,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 10:29:36,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:36,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:29:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:36,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:36,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {9222#true} call ULTIMATE.init(); {9222#true} is VALID [2022-04-28 10:29:36,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {9222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:36,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {9230#(<= 40000 ~SIZE~0)} assume true; {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:36,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9230#(<= 40000 ~SIZE~0)} {9222#true} #45#return; {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:36,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {9230#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:36,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {9230#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {9243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {9247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:29:36,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {9251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:29:36,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {9255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:29:36,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {9259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {9263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:29:36,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {9267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {9271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:29:36,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {9275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:29:36,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {9279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {9283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:29:36,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {9287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:29:36,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {9291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {9295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {9299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {9303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {9307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:29:36,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {9315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:29:36,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {9319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:29:36,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {9323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {9327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:29:36,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {9331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:29:36,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {9335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:29:36,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {9339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:29:36,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {9343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:29:36,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {9347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:36,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {9351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {9223#false} is VALID [2022-04-28 10:29:36,958 INFO L272 TraceCheckUtils]: 34: Hoare triple {9223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9223#false} is VALID [2022-04-28 10:29:36,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {9223#false} ~cond := #in~cond; {9223#false} is VALID [2022-04-28 10:29:36,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {9223#false} assume 0 == ~cond; {9223#false} is VALID [2022-04-28 10:29:36,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {9223#false} assume !false; {9223#false} is VALID [2022-04-28 10:29:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:36,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:38,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {9223#false} assume !false; {9223#false} is VALID [2022-04-28 10:29:38,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {9223#false} assume 0 == ~cond; {9223#false} is VALID [2022-04-28 10:29:38,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {9223#false} ~cond := #in~cond; {9223#false} is VALID [2022-04-28 10:29:38,896 INFO L272 TraceCheckUtils]: 34: Hoare triple {9223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9223#false} is VALID [2022-04-28 10:29:38,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {9379#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {9223#false} is VALID [2022-04-28 10:29:38,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {9383#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9379#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:38,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {9387#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9383#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:38,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {9391#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9387#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:38,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {9395#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9391#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:38,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {9399#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9395#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:38,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {9403#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9399#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:38,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {9407#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9403#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:38,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {9411#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9407#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:38,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {9415#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9411#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:38,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {9419#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9415#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:38,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9419#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:38,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {9427#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9423#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:38,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {9431#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9427#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:38,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9431#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:38,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {9439#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9435#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:38,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {9443#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9439#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:38,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {9447#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9443#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:38,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {9451#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9447#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:38,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {9455#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9451#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:38,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {9459#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9455#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:38,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {9463#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9459#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:38,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {9467#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9463#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:38,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {9471#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9467#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:38,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {9475#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9471#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:38,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {9479#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9475#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:29:38,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {9483#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9479#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:29:38,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9483#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:29:38,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {9491#(< 27 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9487#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:29:38,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {9491#(< 27 ~SIZE~0)} call #t~ret4 := main(); {9491#(< 27 ~SIZE~0)} is VALID [2022-04-28 10:29:38,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9491#(< 27 ~SIZE~0)} {9222#true} #45#return; {9491#(< 27 ~SIZE~0)} is VALID [2022-04-28 10:29:38,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {9491#(< 27 ~SIZE~0)} assume true; {9491#(< 27 ~SIZE~0)} is VALID [2022-04-28 10:29:38,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {9222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {9491#(< 27 ~SIZE~0)} is VALID [2022-04-28 10:29:38,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {9222#true} call ULTIMATE.init(); {9222#true} is VALID [2022-04-28 10:29:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:38,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2966921] [2022-04-28 10:29:38,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:38,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703830849] [2022-04-28 10:29:38,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703830849] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:38,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:38,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2022-04-28 10:29:38,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:38,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2073151072] [2022-04-28 10:29:38,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2073151072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:38,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:38,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 10:29:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665601765] [2022-04-28 10:29:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 10:29:38,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:38,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:38,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 10:29:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 10:29:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:29:38,954 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:43,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:45,150 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 10:29:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:29:45,150 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 10:29:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 10:29:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 10:29:45,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-28 10:29:45,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:45,186 INFO L225 Difference]: With dead ends: 45 [2022-04-28 10:29:45,186 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 10:29:45,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:29:45,187 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:45,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:29:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 10:29:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 10:29:45,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:45,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,219 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,219 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:45,219 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:29:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 10:29:45,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:45,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:45,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 10:29:45,220 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 10:29:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:45,221 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 10:29:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 10:29:45,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:45,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:45,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:45,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-28 10:29:45,222 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-28 10:29:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:45,222 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-28 10:29:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:45,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-28 10:29:45,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 10:29:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:29:45,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:45,252 INFO L195 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:45,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:45,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 10:29:45,453 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash -437584917, now seen corresponding path program 55 times [2022-04-28 10:29:45,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:45,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1541830624] [2022-04-28 10:29:45,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:45,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash -437584917, now seen corresponding path program 56 times [2022-04-28 10:29:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:45,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148437542] [2022-04-28 10:29:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:45,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:29:45,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842810713] [2022-04-28 10:29:45,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:29:45,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:45,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:45,471 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:45,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 10:29:45,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:29:45,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:45,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:29:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:45,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:46,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {9759#true} call ULTIMATE.init(); {9759#true} is VALID [2022-04-28 10:29:46,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {9759#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:46,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {9767#(<= 40000 ~SIZE~0)} assume true; {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:46,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9767#(<= 40000 ~SIZE~0)} {9759#true} #45#return; {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:46,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {9767#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:46,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {9767#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9780#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {9780#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9784#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {9784#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:29:46,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {9788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:29:46,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {9792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:29:46,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {9796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9800#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:29:46,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {9804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9808#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {9808#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:29:46,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {9812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:29:46,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {9816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9820#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {9820#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:29:46,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {9824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9828#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:29:46,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {9828#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9832#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {9832#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9836#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {9836#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9840#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {9840#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9844#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {9844#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:29:46,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {9848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9852#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {9852#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:29:46,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {9856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:29:46,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {9860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9864#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {9864#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:29:46,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {9868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:29:46,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {9872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:29:46,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {9876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:29:46,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {9880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:29:46,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {9884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9888#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:46,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {9888#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:29:46,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {9892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !(~i~0 < ~SIZE~0); {9760#false} is VALID [2022-04-28 10:29:46,433 INFO L272 TraceCheckUtils]: 35: Hoare triple {9760#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9760#false} is VALID [2022-04-28 10:29:46,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {9760#false} ~cond := #in~cond; {9760#false} is VALID [2022-04-28 10:29:46,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {9760#false} assume 0 == ~cond; {9760#false} is VALID [2022-04-28 10:29:46,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {9760#false} assume !false; {9760#false} is VALID [2022-04-28 10:29:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:46,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:48,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {9760#false} assume !false; {9760#false} is VALID [2022-04-28 10:29:48,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {9760#false} assume 0 == ~cond; {9760#false} is VALID [2022-04-28 10:29:48,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {9760#false} ~cond := #in~cond; {9760#false} is VALID [2022-04-28 10:29:48,623 INFO L272 TraceCheckUtils]: 35: Hoare triple {9760#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9760#false} is VALID [2022-04-28 10:29:48,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {9920#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {9760#false} is VALID [2022-04-28 10:29:48,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {9924#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9920#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:48,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {9928#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9924#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:48,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {9932#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9928#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:48,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {9936#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9932#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:48,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {9940#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9936#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:48,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {9944#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9940#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:48,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {9948#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9944#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:48,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {9952#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9948#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:48,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {9956#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9952#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:48,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {9960#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9956#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:48,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {9964#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9960#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:48,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {9968#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9964#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:48,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {9972#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9968#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:48,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {9976#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9972#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:48,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {9980#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9976#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:48,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {9984#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9980#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:48,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {9988#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9984#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:48,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {9992#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9988#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:48,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9992#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:48,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {10000#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9996#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:48,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {10004#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10000#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:48,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {10008#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10004#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:48,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {10012#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10008#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:48,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {10016#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10012#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:48,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {10020#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10016#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:29:48,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {10024#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10020#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:29:48,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {10028#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10024#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:29:48,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {10032#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10028#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:29:48,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {10036#(< 28 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10032#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:29:48,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {10036#(< 28 ~SIZE~0)} call #t~ret4 := main(); {10036#(< 28 ~SIZE~0)} is VALID [2022-04-28 10:29:48,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10036#(< 28 ~SIZE~0)} {9759#true} #45#return; {10036#(< 28 ~SIZE~0)} is VALID [2022-04-28 10:29:48,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {10036#(< 28 ~SIZE~0)} assume true; {10036#(< 28 ~SIZE~0)} is VALID [2022-04-28 10:29:48,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {9759#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10036#(< 28 ~SIZE~0)} is VALID [2022-04-28 10:29:48,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {9759#true} call ULTIMATE.init(); {9759#true} is VALID [2022-04-28 10:29:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:48,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:48,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148437542] [2022-04-28 10:29:48,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:48,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842810713] [2022-04-28 10:29:48,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842810713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:48,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:48,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2022-04-28 10:29:48,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:48,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1541830624] [2022-04-28 10:29:48,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1541830624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:48,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:48,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 10:29:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600410660] [2022-04-28 10:29:48,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:48,656 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 10:29:48,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:48,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:48,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:48,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 10:29:48,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 10:29:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:29:48,688 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:52,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:54,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:29:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:54,887 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 10:29:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:29:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 10:29:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 10:29:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 10:29:54,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-28 10:29:54,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:54,924 INFO L225 Difference]: With dead ends: 46 [2022-04-28 10:29:54,924 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 10:29:54,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:29:54,925 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:54,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 10:29:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 10:29:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 10:29:54,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:54,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,964 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,964 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:54,965 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 10:29:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 10:29:54,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:54,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:54,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 10:29:54,965 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 10:29:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:54,966 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 10:29:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 10:29:54,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:54,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:54,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:54,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 10:29:54,967 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-28 10:29:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:54,967 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 10:29:54,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:54,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 10:29:55,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 10:29:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:29:55,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:55,004 INFO L195 NwaCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:55,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:55,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:29:55,205 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -645735470, now seen corresponding path program 57 times [2022-04-28 10:29:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:55,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630889225] [2022-04-28 10:29:55,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:55,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -645735470, now seen corresponding path program 58 times [2022-04-28 10:29:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:55,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931638570] [2022-04-28 10:29:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:55,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:29:55,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078111105] [2022-04-28 10:29:55,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:29:55,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:55,224 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:55,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 10:29:55,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:29:55,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:55,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:29:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:55,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:56,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {10310#true} call ULTIMATE.init(); {10310#true} is VALID [2022-04-28 10:29:56,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {10310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:56,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {10318#(<= 40000 ~SIZE~0)} assume true; {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:56,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10318#(<= 40000 ~SIZE~0)} {10310#true} #45#return; {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:56,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {10318#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:29:56,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {10318#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10331#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {10331#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10335#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {10335#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:29:56,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {10339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:29:56,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {10343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:29:56,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {10347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10351#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {10351#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:29:56,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {10355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10359#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {10359#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:29:56,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {10363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10367#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:29:56,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {10367#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10371#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {10371#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:29:56,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {10375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:29:56,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {10379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10383#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {10383#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10387#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {10387#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10391#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {10391#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10395#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {10395#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10399#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:29:56,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {10399#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10403#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {10403#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10407#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:29:56,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {10407#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10411#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:29:56,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {10411#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10415#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {10415#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10419#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:29:56,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {10419#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10423#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:29:56,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {10423#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10427#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:29:56,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {10427#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10431#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:29:56,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {10431#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10435#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:29:56,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {10435#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10439#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:29:56,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {10439#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10443#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:29:56,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {10443#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10447#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:29:56,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {10447#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !(~i~0 < ~SIZE~0); {10311#false} is VALID [2022-04-28 10:29:56,162 INFO L272 TraceCheckUtils]: 36: Hoare triple {10311#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10311#false} is VALID [2022-04-28 10:29:56,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {10311#false} ~cond := #in~cond; {10311#false} is VALID [2022-04-28 10:29:56,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {10311#false} assume 0 == ~cond; {10311#false} is VALID [2022-04-28 10:29:56,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {10311#false} assume !false; {10311#false} is VALID [2022-04-28 10:29:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:56,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:58,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {10311#false} assume !false; {10311#false} is VALID [2022-04-28 10:29:58,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {10311#false} assume 0 == ~cond; {10311#false} is VALID [2022-04-28 10:29:58,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {10311#false} ~cond := #in~cond; {10311#false} is VALID [2022-04-28 10:29:58,528 INFO L272 TraceCheckUtils]: 36: Hoare triple {10311#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10311#false} is VALID [2022-04-28 10:29:58,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {10475#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {10311#false} is VALID [2022-04-28 10:29:58,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {10479#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10475#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:29:58,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {10483#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10479#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:29:58,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {10487#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10483#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:29:58,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {10491#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10487#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:29:58,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {10495#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10491#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:29:58,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {10499#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10495#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:58,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {10503#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10499#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:29:58,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {10507#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10503#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:58,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {10511#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10507#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:29:58,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {10515#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10511#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:29:58,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {10519#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10515#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:29:58,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {10523#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10519#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:29:58,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {10527#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10523#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:29:58,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {10531#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10527#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:29:58,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {10535#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10531#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:29:58,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {10539#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10535#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:29:58,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {10543#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10539#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:29:58,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {10547#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10543#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:29:58,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {10551#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10547#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:29:58,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10551#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:58,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {10559#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10555#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:29:58,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {10563#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10559#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:29:58,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {10567#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10563#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:29:58,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {10571#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10567#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:58,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {10575#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10571#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:29:58,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {10579#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10575#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:29:58,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {10583#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10579#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:29:58,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {10587#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10583#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:29:58,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {10591#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10587#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:29:58,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {10595#(< 29 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10591#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:29:58,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {10595#(< 29 ~SIZE~0)} call #t~ret4 := main(); {10595#(< 29 ~SIZE~0)} is VALID [2022-04-28 10:29:58,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10595#(< 29 ~SIZE~0)} {10310#true} #45#return; {10595#(< 29 ~SIZE~0)} is VALID [2022-04-28 10:29:58,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {10595#(< 29 ~SIZE~0)} assume true; {10595#(< 29 ~SIZE~0)} is VALID [2022-04-28 10:29:58,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {10310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10595#(< 29 ~SIZE~0)} is VALID [2022-04-28 10:29:58,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {10310#true} call ULTIMATE.init(); {10310#true} is VALID [2022-04-28 10:29:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931638570] [2022-04-28 10:29:58,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:29:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078111105] [2022-04-28 10:29:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078111105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:29:58,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:58,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2022-04-28 10:29:58,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630889225] [2022-04-28 10:29:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630889225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:58,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:58,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 10:29:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845946661] [2022-04-28 10:29:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:29:58,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:58,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:58,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:58,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 10:29:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:58,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 10:29:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:29:58,591 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:06,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:30:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:06,923 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 10:30:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:30:06,923 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:30:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 10:30:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 10:30:06,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-28 10:30:06,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:06,971 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:30:06,971 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 10:30:06,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:30:06,972 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:06,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 10:30:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 10:30:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 10:30:07,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:07,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:07,005 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:07,005 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:07,005 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 10:30:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 10:30:07,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:07,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:07,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 10:30:07,006 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 10:30:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:07,007 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 10:30:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 10:30:07,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:07,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:07,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:07,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-28 10:30:07,008 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-28 10:30:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:07,008 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-28 10:30:07,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:07,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-28 10:30:07,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 10:30:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:30:07,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:07,049 INFO L195 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:07,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:07,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:07,250 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1491531979, now seen corresponding path program 59 times [2022-04-28 10:30:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:07,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324292889] [2022-04-28 10:30:07,253 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:07,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1491531979, now seen corresponding path program 60 times [2022-04-28 10:30:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:07,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280560976] [2022-04-28 10:30:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:07,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:30:07,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148014949] [2022-04-28 10:30:07,275 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:30:07,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:07,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:07,276 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:07,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 10:30:07,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 10:30:07,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:07,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:30:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:07,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:08,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {10875#true} call ULTIMATE.init(); {10875#true} is VALID [2022-04-28 10:30:08,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {10875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:08,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {10883#(<= 40000 ~SIZE~0)} assume true; {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:08,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10883#(<= 40000 ~SIZE~0)} {10875#true} #45#return; {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:08,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {10883#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:08,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {10883#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10896#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {10896#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10900#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {10900#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:30:08,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {10904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:30:08,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {10908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:30:08,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {10912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10916#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {10916#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:30:08,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {10920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10924#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {10924#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:30:08,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {10928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:30:08,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {10932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10936#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {10936#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:30:08,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {10940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:30:08,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {10944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10948#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {10948#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10952#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {10952#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10956#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {10956#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10960#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {10960#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:30:08,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {10964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10968#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {10968#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:30:08,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {10972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:30:08,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {10976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10980#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {10980#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:30:08,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {10984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:30:08,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {10988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10992#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:30:08,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {10992#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:30:08,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {10996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:30:08,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {11000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11004#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {11004#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:30:08,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {11008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:30:08,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {11012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11016#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:08,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {11016#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {10876#false} is VALID [2022-04-28 10:30:08,272 INFO L272 TraceCheckUtils]: 37: Hoare triple {10876#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10876#false} is VALID [2022-04-28 10:30:08,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {10876#false} ~cond := #in~cond; {10876#false} is VALID [2022-04-28 10:30:08,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {10876#false} assume 0 == ~cond; {10876#false} is VALID [2022-04-28 10:30:08,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {10876#false} assume !false; {10876#false} is VALID [2022-04-28 10:30:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:08,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:10,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {10876#false} assume !false; {10876#false} is VALID [2022-04-28 10:30:10,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {10876#false} assume 0 == ~cond; {10876#false} is VALID [2022-04-28 10:30:10,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {10876#false} ~cond := #in~cond; {10876#false} is VALID [2022-04-28 10:30:10,973 INFO L272 TraceCheckUtils]: 37: Hoare triple {10876#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10876#false} is VALID [2022-04-28 10:30:10,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {11044#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {10876#false} is VALID [2022-04-28 10:30:10,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {11048#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11044#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:30:10,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {11052#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11048#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:30:10,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {11056#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11052#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:30:10,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {11060#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11056#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:30:10,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {11064#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11060#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:30:10,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {11068#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11064#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:10,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {11072#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11068#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:30:10,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11072#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:10,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {11080#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11076#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:30:10,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {11084#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11080#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:30:10,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {11088#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11084#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:30:10,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {11092#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11088#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:30:10,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {11096#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11092#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:30:10,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {11100#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11096#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:30:10,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {11104#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11100#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:30:10,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {11108#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11104#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:30:10,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {11112#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11108#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:30:10,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {11116#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11112#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:30:10,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {11120#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11116#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:30:10,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {11124#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11120#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:10,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {11128#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11124#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:30:10,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {11132#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11128#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:30:10,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {11136#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11132#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:30:10,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {11140#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11136#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:10,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {11144#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11140#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:30:11,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {11148#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11144#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:30:11,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {11152#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11148#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:30:11,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {11156#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11152#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:30:11,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {11160#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11156#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:30:11,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {11164#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11160#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:11,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {11168#(< 30 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11164#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:11,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {11168#(< 30 ~SIZE~0)} call #t~ret4 := main(); {11168#(< 30 ~SIZE~0)} is VALID [2022-04-28 10:30:11,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11168#(< 30 ~SIZE~0)} {10875#true} #45#return; {11168#(< 30 ~SIZE~0)} is VALID [2022-04-28 10:30:11,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {11168#(< 30 ~SIZE~0)} assume true; {11168#(< 30 ~SIZE~0)} is VALID [2022-04-28 10:30:11,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {10875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {11168#(< 30 ~SIZE~0)} is VALID [2022-04-28 10:30:11,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {10875#true} call ULTIMATE.init(); {10875#true} is VALID [2022-04-28 10:30:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:11,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280560976] [2022-04-28 10:30:11,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:30:11,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148014949] [2022-04-28 10:30:11,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148014949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:30:11,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:11,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-04-28 10:30:11,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:11,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324292889] [2022-04-28 10:30:11,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324292889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:11,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:11,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 10:30:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523996567] [2022-04-28 10:30:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:11,020 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 10:30:11,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:11,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:11,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:11,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 10:30:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 10:30:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:30:11,051 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:23,721 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 10:30:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:30:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 10:30:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 10:30:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 10:30:23,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-28 10:30:23,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:23,769 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:30:23,769 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 10:30:23,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:30:23,770 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:23,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:30:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 10:30:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 10:30:23,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:23,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,810 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,810 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:23,811 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 10:30:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 10:30:23,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:23,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:23,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 10:30:23,811 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 10:30:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:23,812 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 10:30:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 10:30:23,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:23,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:23,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:23,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 10:30:23,813 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-28 10:30:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:23,813 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 10:30:23,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 10:30:23,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 10:30:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:30:23,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:23,856 INFO L195 NwaCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:23,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:24,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:24,056 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:24,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash -972653838, now seen corresponding path program 61 times [2022-04-28 10:30:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:24,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546503587] [2022-04-28 10:30:24,060 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:24,060 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash -972653838, now seen corresponding path program 62 times [2022-04-28 10:30:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:24,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186723554] [2022-04-28 10:30:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:24,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:30:24,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366659963] [2022-04-28 10:30:24,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:24,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:24,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:24,080 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:24,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 10:30:24,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:30:24,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:24,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:30:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:24,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:25,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {11454#true} call ULTIMATE.init(); {11454#true} is VALID [2022-04-28 10:30:25,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {11454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:25,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {11462#(<= 40000 ~SIZE~0)} assume true; {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:25,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11462#(<= 40000 ~SIZE~0)} {11454#true} #45#return; {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:25,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {11462#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:25,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {11462#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11475#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {11475#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11479#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {11479#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:30:25,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {11483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:30:25,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {11487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11491#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:30:25,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {11491#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11495#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {11495#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:30:25,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {11499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11503#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {11503#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11507#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:30:25,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {11507#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11511#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:30:25,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {11511#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11515#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {11515#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:30:25,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {11519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:30:25,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {11523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11527#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11531#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {11531#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11535#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {11535#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11539#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {11539#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11543#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:30:25,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {11543#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11547#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {11547#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:30:25,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {11551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11555#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:30:25,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {11555#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11559#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {11559#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:30:25,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {11563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:30:25,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {11567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:30:25,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {11571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11575#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:30:25,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {11575#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:30:25,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {11579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11583#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {11583#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:30:25,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {11587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:30:25,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {11591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11595#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {11595#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11599#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:25,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {11599#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {11455#false} is VALID [2022-04-28 10:30:25,151 INFO L272 TraceCheckUtils]: 38: Hoare triple {11455#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {11455#false} is VALID [2022-04-28 10:30:25,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {11455#false} ~cond := #in~cond; {11455#false} is VALID [2022-04-28 10:30:25,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {11455#false} assume 0 == ~cond; {11455#false} is VALID [2022-04-28 10:30:25,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {11455#false} assume !false; {11455#false} is VALID [2022-04-28 10:30:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:25,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:28,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {11455#false} assume !false; {11455#false} is VALID [2022-04-28 10:30:28,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {11455#false} assume 0 == ~cond; {11455#false} is VALID [2022-04-28 10:30:28,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {11455#false} ~cond := #in~cond; {11455#false} is VALID [2022-04-28 10:30:28,147 INFO L272 TraceCheckUtils]: 38: Hoare triple {11455#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {11455#false} is VALID [2022-04-28 10:30:28,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {11627#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {11455#false} is VALID [2022-04-28 10:30:28,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {11631#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11627#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:30:28,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {11635#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11631#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:30:28,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {11639#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11635#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:30:28,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {11643#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11639#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:30:28,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {11647#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11643#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:30:28,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {11651#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11647#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:28,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {11655#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11651#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:30:28,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {11659#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11655#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:28,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {11663#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11659#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:30:28,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {11667#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11663#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:30:28,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {11671#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11667#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:30:28,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {11675#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11671#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:30:28,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {11679#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11675#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:30:28,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {11683#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11679#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:30:28,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {11687#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11683#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:30:28,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {11691#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11687#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:30:28,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {11695#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11691#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:30:28,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {11699#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11695#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:30:28,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11699#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:30:28,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {11707#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11703#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:28,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {11711#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11707#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:30:28,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {11715#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11711#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:30:28,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {11719#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11715#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:30:28,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {11723#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11719#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:28,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {11727#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11723#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:30:28,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {11731#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11727#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:30:28,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {11735#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11731#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:30:28,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {11739#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11735#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:30:28,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {11743#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11739#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:30:28,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {11747#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11743#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:28,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {11751#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11747#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:28,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {11755#(< 31 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11751#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:30:28,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {11755#(< 31 ~SIZE~0)} call #t~ret4 := main(); {11755#(< 31 ~SIZE~0)} is VALID [2022-04-28 10:30:28,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11755#(< 31 ~SIZE~0)} {11454#true} #45#return; {11755#(< 31 ~SIZE~0)} is VALID [2022-04-28 10:30:28,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {11755#(< 31 ~SIZE~0)} assume true; {11755#(< 31 ~SIZE~0)} is VALID [2022-04-28 10:30:28,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {11454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {11755#(< 31 ~SIZE~0)} is VALID [2022-04-28 10:30:28,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {11454#true} call ULTIMATE.init(); {11454#true} is VALID [2022-04-28 10:30:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186723554] [2022-04-28 10:30:28,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:30:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366659963] [2022-04-28 10:30:28,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366659963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:30:28,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:28,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2022-04-28 10:30:28,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546503587] [2022-04-28 10:30:28,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546503587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:28,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:28,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 10:30:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756092736] [2022-04-28 10:30:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 10:30:28,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:28,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:28,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 10:30:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 10:30:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:30:28,214 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:32,432 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 10:30:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:30:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 10:30:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 10:30:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 10:30:32,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-28 10:30:32,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:32,469 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:30:32,469 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 10:30:32,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:30:32,471 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:32,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:30:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 10:30:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 10:30:32,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:32,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,521 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,521 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:32,522 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 10:30:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 10:30:32,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:32,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:32,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 10:30:32,522 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 10:30:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:32,523 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 10:30:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 10:30:32,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:32,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:32,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:32,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-28 10:30:32,524 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-28 10:30:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:32,524 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-28 10:30:32,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:32,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-28 10:30:32,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 10:30:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:30:32,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:32,568 INFO L195 NwaCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:32,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:32,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:32,769 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -53002837, now seen corresponding path program 63 times [2022-04-28 10:30:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:32,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820203693] [2022-04-28 10:30:32,777 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:32,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash -53002837, now seen corresponding path program 64 times [2022-04-28 10:30:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:32,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666071427] [2022-04-28 10:30:32,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:32,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:30:32,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989072965] [2022-04-28 10:30:32,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:30:32,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:32,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:32,799 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:32,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 10:30:32,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:30:32,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:32,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:30:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:32,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:33,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {12047#true} call ULTIMATE.init(); {12047#true} is VALID [2022-04-28 10:30:33,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {12047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:33,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#(<= 40000 ~SIZE~0)} assume true; {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:33,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#(<= 40000 ~SIZE~0)} {12047#true} #45#return; {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:33,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {12055#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:33,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {12055#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12068#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {12068#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12072#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {12072#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:30:33,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {12076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12080#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:30:33,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {12080#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:30:33,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {12084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12088#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {12088#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12092#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:30:33,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {12092#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12096#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {12096#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12100#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:30:33,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {12100#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12104#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:30:33,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {12104#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12108#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {12108#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12112#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:30:33,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {12112#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12116#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:30:33,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {12116#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12120#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {12120#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12124#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {12124#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12128#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {12128#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12132#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {12132#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12136#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:30:33,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12140#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {12140#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12144#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:30:33,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {12144#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12148#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:30:33,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {12148#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12152#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {12152#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12156#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:30:33,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {12156#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12160#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:30:33,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {12160#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12164#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:30:33,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {12164#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12168#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:30:33,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {12168#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12172#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:30:33,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {12172#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12176#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {12176#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12180#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:30:33,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {12180#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12184#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:30:33,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {12184#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12188#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {12188#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12192#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {12192#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12196#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:33,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {12196#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {12048#false} is VALID [2022-04-28 10:30:33,917 INFO L272 TraceCheckUtils]: 39: Hoare triple {12048#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12048#false} is VALID [2022-04-28 10:30:33,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {12048#false} ~cond := #in~cond; {12048#false} is VALID [2022-04-28 10:30:33,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {12048#false} assume 0 == ~cond; {12048#false} is VALID [2022-04-28 10:30:33,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#false} assume !false; {12048#false} is VALID [2022-04-28 10:30:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:33,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:37,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#false} assume !false; {12048#false} is VALID [2022-04-28 10:30:37,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {12048#false} assume 0 == ~cond; {12048#false} is VALID [2022-04-28 10:30:37,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {12048#false} ~cond := #in~cond; {12048#false} is VALID [2022-04-28 10:30:37,242 INFO L272 TraceCheckUtils]: 39: Hoare triple {12048#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12048#false} is VALID [2022-04-28 10:30:37,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {12224#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {12048#false} is VALID [2022-04-28 10:30:37,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {12228#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12224#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:30:37,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {12232#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12228#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:30:37,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {12236#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12232#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:30:37,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12236#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:30:37,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {12244#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12240#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:30:37,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {12248#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12244#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {12252#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12248#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:30:37,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {12256#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12252#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {12260#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12256#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:30:37,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {12264#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12260#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:30:37,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {12268#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12264#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:30:37,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {12272#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12268#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:30:37,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {12276#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12272#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:30:37,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12276#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:30:37,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {12284#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12280#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:30:37,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12284#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:30:37,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {12292#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12288#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:30:37,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {12296#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12292#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:30:37,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {12300#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12296#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:30:37,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {12304#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12300#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {12308#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12304#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:30:37,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {12312#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12308#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:30:37,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {12316#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12312#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:30:37,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {12320#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12316#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {12324#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12320#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:30:37,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {12328#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12324#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:30:37,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {12332#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12328#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:30:37,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {12336#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12332#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:30:37,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {12340#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12336#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:30:37,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {12344#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12340#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {12348#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12344#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {12352#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12348#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:30:37,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {12356#(< 32 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12352#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:37,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {12356#(< 32 ~SIZE~0)} call #t~ret4 := main(); {12356#(< 32 ~SIZE~0)} is VALID [2022-04-28 10:30:37,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12356#(< 32 ~SIZE~0)} {12047#true} #45#return; {12356#(< 32 ~SIZE~0)} is VALID [2022-04-28 10:30:37,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {12356#(< 32 ~SIZE~0)} assume true; {12356#(< 32 ~SIZE~0)} is VALID [2022-04-28 10:30:37,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {12047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12356#(< 32 ~SIZE~0)} is VALID [2022-04-28 10:30:37,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {12047#true} call ULTIMATE.init(); {12047#true} is VALID [2022-04-28 10:30:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:37,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:37,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666071427] [2022-04-28 10:30:37,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:30:37,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989072965] [2022-04-28 10:30:37,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989072965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:30:37,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:37,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2022-04-28 10:30:37,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:37,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820203693] [2022-04-28 10:30:37,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820203693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:37,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:37,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 10:30:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125700759] [2022-04-28 10:30:37,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:37,283 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:30:37,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:37,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:37,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:37,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 10:30:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 10:30:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:30:37,315 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:47,856 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 10:30:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:30:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:30:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 10:30:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 10:30:47,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-28 10:30:47,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:47,904 INFO L225 Difference]: With dead ends: 50 [2022-04-28 10:30:47,904 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 10:30:47,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:30:47,905 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:47,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:30:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 10:30:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 10:30:47,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:47,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,941 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,941 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:47,942 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 10:30:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 10:30:47,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:47,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:47,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 10:30:47,942 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 10:30:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:47,942 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 10:30:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 10:30:47,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:47,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:47,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:47,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 10:30:47,943 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-28 10:30:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:47,944 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 10:30:47,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:47,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 10:30:47,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 10:30:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:30:47,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:47,980 INFO L195 NwaCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:47,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:48,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 10:30:48,187 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1608592878, now seen corresponding path program 65 times [2022-04-28 10:30:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493534855] [2022-04-28 10:30:48,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:48,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1608592878, now seen corresponding path program 66 times [2022-04-28 10:30:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738017602] [2022-04-28 10:30:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:48,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:30:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208167516] [2022-04-28 10:30:48,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:30:48,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:48,208 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:48,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 10:30:48,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-28 10:30:48,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:48,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:30:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:48,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:49,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {12654#true} call ULTIMATE.init(); {12654#true} is VALID [2022-04-28 10:30:49,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {12654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:49,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#(<= 40000 ~SIZE~0)} assume true; {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:49,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#(<= 40000 ~SIZE~0)} {12654#true} #45#return; {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:49,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {12662#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:49,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {12662#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12675#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {12675#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12679#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {12679#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:30:49,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {12683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:30:49,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {12687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:30:49,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {12691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12695#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {12695#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:30:49,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {12699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12703#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {12703#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:30:49,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {12707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:30:49,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {12711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12715#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {12715#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:30:49,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {12719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:30:49,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {12723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12727#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {12727#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12731#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {12731#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12735#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {12735#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12739#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {12739#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:30:49,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {12743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12747#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {12747#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:30:49,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {12751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:30:49,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {12755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12759#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {12759#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12763#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:30:49,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {12763#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:30:49,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {12767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12771#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:30:49,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {12771#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:30:49,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {12775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:30:49,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {12779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12783#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {12783#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:30:49,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {12787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:30:49,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {12791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12795#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {12795#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12799#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {12799#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12803#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:49,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {12803#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12807#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:30:49,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {12807#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !(~i~0 < ~SIZE~0); {12655#false} is VALID [2022-04-28 10:30:49,385 INFO L272 TraceCheckUtils]: 40: Hoare triple {12655#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12655#false} is VALID [2022-04-28 10:30:49,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {12655#false} ~cond := #in~cond; {12655#false} is VALID [2022-04-28 10:30:49,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {12655#false} assume 0 == ~cond; {12655#false} is VALID [2022-04-28 10:30:49,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {12655#false} assume !false; {12655#false} is VALID [2022-04-28 10:30:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:49,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:53,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {12655#false} assume !false; {12655#false} is VALID [2022-04-28 10:30:53,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {12655#false} assume 0 == ~cond; {12655#false} is VALID [2022-04-28 10:30:53,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {12655#false} ~cond := #in~cond; {12655#false} is VALID [2022-04-28 10:30:53,068 INFO L272 TraceCheckUtils]: 40: Hoare triple {12655#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12655#false} is VALID [2022-04-28 10:30:53,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {12835#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {12655#false} is VALID [2022-04-28 10:30:53,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {12839#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12835#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:30:53,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {12843#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12839#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:30:53,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {12847#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12843#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:30:53,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {12851#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12847#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:30:53,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {12855#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12851#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:30:53,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {12859#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12855#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {12863#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12859#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:30:53,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {12867#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12863#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {12871#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12867#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:30:53,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {12875#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12871#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:30:53,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {12879#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12875#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:30:53,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {12883#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12879#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:30:53,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {12887#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12883#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:30:53,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {12891#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12887#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:30:53,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {12895#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12891#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:30:53,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {12899#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12895#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:30:53,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {12903#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12899#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:30:53,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {12907#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12903#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:30:53,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {12911#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12907#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:30:53,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {12915#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12911#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {12919#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12915#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:30:53,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {12923#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12919#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:30:53,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {12927#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12923#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:30:53,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {12931#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12927#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {12935#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12931#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:30:53,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {12939#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12935#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:30:53,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {12943#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12939#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:30:53,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {12947#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12943#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:30:53,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {12951#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12947#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:30:53,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {12955#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12951#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {12959#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12955#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {12963#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12959#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:30:53,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {12967#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12963#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:30:53,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {12971#(< 33 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12967#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:30:53,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {12971#(< 33 ~SIZE~0)} call #t~ret4 := main(); {12971#(< 33 ~SIZE~0)} is VALID [2022-04-28 10:30:53,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12971#(< 33 ~SIZE~0)} {12654#true} #45#return; {12971#(< 33 ~SIZE~0)} is VALID [2022-04-28 10:30:53,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {12971#(< 33 ~SIZE~0)} assume true; {12971#(< 33 ~SIZE~0)} is VALID [2022-04-28 10:30:53,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {12654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12971#(< 33 ~SIZE~0)} is VALID [2022-04-28 10:30:53,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {12654#true} call ULTIMATE.init(); {12654#true} is VALID [2022-04-28 10:30:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738017602] [2022-04-28 10:30:53,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:30:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208167516] [2022-04-28 10:30:53,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208167516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:30:53,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:53,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2022-04-28 10:30:53,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493534855] [2022-04-28 10:30:53,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493534855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:53,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:53,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 10:30:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526054071] [2022-04-28 10:30:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 10:30:53,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:53,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:53,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:53,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 10:30:53,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 10:30:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:30:53,147 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:55,358 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 10:30:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:30:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 10:30:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 10:30:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 10:30:55,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-28 10:30:55,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:55,415 INFO L225 Difference]: With dead ends: 51 [2022-04-28 10:30:55,415 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:30:55,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:30:55,416 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:55,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:30:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:30:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 10:30:55,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:55,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,457 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,457 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:55,458 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 10:30:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 10:30:55,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:55,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:55,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 10:30:55,459 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 10:30:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:55,459 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 10:30:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 10:30:55,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:55,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:55,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:55,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-28 10:30:55,461 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-28 10:30:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:55,461 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-28 10:30:55,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:55,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-28 10:30:55,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 10:30:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:30:55,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:55,508 INFO L195 NwaCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:55,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:55,709 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1707723403, now seen corresponding path program 67 times [2022-04-28 10:30:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:55,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007690660] [2022-04-28 10:30:55,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:55,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1707723403, now seen corresponding path program 68 times [2022-04-28 10:30:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:55,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264668959] [2022-04-28 10:30:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:55,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:30:55,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631408886] [2022-04-28 10:30:55,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:55,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:55,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:55,728 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:55,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 10:30:55,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:30:55,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:55,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:30:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:55,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:56,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {13275#true} call ULTIMATE.init(); {13275#true} is VALID [2022-04-28 10:30:56,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {13275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:56,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {13283#(<= 40000 ~SIZE~0)} assume true; {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:56,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13283#(<= 40000 ~SIZE~0)} {13275#true} #45#return; {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:56,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {13283#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:30:56,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {13283#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {13296#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {13296#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13300#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {13300#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:30:56,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {13304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:30:56,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {13308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:30:56,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {13312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13316#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {13316#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:30:56,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {13320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13324#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {13324#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:30:56,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {13328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:30:56,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {13332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13336#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {13336#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:30:56,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {13340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:30:56,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {13344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13348#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {13348#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13352#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {13352#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13356#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {13356#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13360#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {13360#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:30:56,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {13364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13368#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {13368#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:30:56,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {13372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:30:56,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {13376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13380#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {13380#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:30:56,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {13384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:30:56,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {13388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:30:56,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {13392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:30:56,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {13396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13400#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:30:56,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {13400#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13404#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {13404#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:30:56,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {13408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:30:56,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {13412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13416#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {13416#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13420#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {13420#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13424#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:30:56,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {13424#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:30:56,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {13428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:30:56,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {13432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !(~i~0 < ~SIZE~0); {13276#false} is VALID [2022-04-28 10:30:56,870 INFO L272 TraceCheckUtils]: 41: Hoare triple {13276#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13276#false} is VALID [2022-04-28 10:30:56,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {13276#false} ~cond := #in~cond; {13276#false} is VALID [2022-04-28 10:30:56,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {13276#false} assume 0 == ~cond; {13276#false} is VALID [2022-04-28 10:30:56,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {13276#false} assume !false; {13276#false} is VALID [2022-04-28 10:30:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:56,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:31:00,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {13276#false} assume !false; {13276#false} is VALID [2022-04-28 10:31:00,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {13276#false} assume 0 == ~cond; {13276#false} is VALID [2022-04-28 10:31:00,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {13276#false} ~cond := #in~cond; {13276#false} is VALID [2022-04-28 10:31:00,962 INFO L272 TraceCheckUtils]: 41: Hoare triple {13276#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13276#false} is VALID [2022-04-28 10:31:00,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {13460#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {13276#false} is VALID [2022-04-28 10:31:00,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {13464#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13460#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:31:00,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {13468#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13464#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:31:00,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {13472#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13468#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:31:00,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {13476#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13472#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:31:00,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {13480#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13476#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:31:00,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {13484#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13480#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {13488#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13484#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:31:00,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {13492#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13488#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {13496#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13492#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:31:00,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {13500#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13496#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:31:00,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {13504#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13500#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:31:00,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {13508#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13504#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:31:00,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {13512#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13508#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:31:00,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {13516#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13512#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:31:00,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13516#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:31:00,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {13524#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13520#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:31:00,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {13528#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13524#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:31:00,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {13532#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13528#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:31:00,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {13536#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13532#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:31:00,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {13540#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13536#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {13544#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13540#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:31:00,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {13548#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13544#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:31:00,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {13552#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13548#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:31:00,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {13556#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13552#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {13560#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13556#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:31:00,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {13564#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13560#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:31:00,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {13568#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13564#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:31:00,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {13572#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13568#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:31:00,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {13576#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13572#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:31:00,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {13580#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13576#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {13584#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13580#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {13588#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13584#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:31:00,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {13592#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13588#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:00,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {13596#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13592#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:31:00,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {13600#(< 34 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {13596#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:31:00,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {13600#(< 34 ~SIZE~0)} call #t~ret4 := main(); {13600#(< 34 ~SIZE~0)} is VALID [2022-04-28 10:31:00,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13600#(< 34 ~SIZE~0)} {13275#true} #45#return; {13600#(< 34 ~SIZE~0)} is VALID [2022-04-28 10:31:00,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {13600#(< 34 ~SIZE~0)} assume true; {13600#(< 34 ~SIZE~0)} is VALID [2022-04-28 10:31:00,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {13275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {13600#(< 34 ~SIZE~0)} is VALID [2022-04-28 10:31:00,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {13275#true} call ULTIMATE.init(); {13275#true} is VALID [2022-04-28 10:31:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:31:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264668959] [2022-04-28 10:31:00,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:31:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631408886] [2022-04-28 10:31:00,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631408886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:31:00,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:31:00,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2022-04-28 10:31:00,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:31:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007690660] [2022-04-28 10:31:00,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007690660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:31:00,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:31:00,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 10:31:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884472179] [2022-04-28 10:31:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:31:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 10:31:01,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:31:01,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:01,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:01,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 10:31:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:01,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 10:31:01,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:31:01,036 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:07,512 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 10:31:07,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:31:07,513 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 10:31:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:31:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 10:31:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 10:31:07,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-28 10:31:07,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:07,561 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:31:07,561 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:31:07,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:31:07,562 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:31:07,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:31:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:31:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 10:31:07,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:31:07,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,597 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,597 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:07,598 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 10:31:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 10:31:07,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:07,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:07,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 10:31:07,598 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 10:31:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:07,599 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 10:31:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 10:31:07,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:07,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:07,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:31:07,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:31:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 10:31:07,600 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-28 10:31:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:31:07,600 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 10:31:07,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:07,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 10:31:07,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 10:31:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:31:07,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:31:07,640 INFO L195 NwaCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:31:07,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 10:31:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 10:31:07,851 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:31:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:31:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1434313010, now seen corresponding path program 69 times [2022-04-28 10:31:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2124741408] [2022-04-28 10:31:07,854 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:31:07,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:31:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1434313010, now seen corresponding path program 70 times [2022-04-28 10:31:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:31:07,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990685306] [2022-04-28 10:31:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:31:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:31:07,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:31:07,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826847769] [2022-04-28 10:31:07,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:31:07,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:07,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:31:07,874 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:31:07,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 10:31:07,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:31:07,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:31:07,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:31:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:07,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:31:09,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-28 10:31:09,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {13910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:09,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {13918#(<= 40000 ~SIZE~0)} assume true; {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:09,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13918#(<= 40000 ~SIZE~0)} {13910#true} #45#return; {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:09,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {13918#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:09,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {13918#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {13931#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {13931#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13935#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:31:09,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {13939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13943#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:31:09,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {13943#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13947#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:31:09,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {13947#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13951#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {13951#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13955#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:31:09,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {13955#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13959#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {13959#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13963#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:31:09,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {13963#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13967#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:31:09,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {13967#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13971#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {13971#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13975#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:31:09,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {13975#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:31:09,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {13979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13983#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {13983#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13987#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {13987#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13991#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {13991#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13995#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {13995#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13999#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:31:09,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {13999#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14003#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {14003#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:31:09,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {14007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14011#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:31:09,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {14011#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14015#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {14015#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14019#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:31:09,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {14019#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14023#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:31:09,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {14023#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14027#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:31:09,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {14027#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14031#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:31:09,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {14031#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14035#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:31:09,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {14035#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14039#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {14039#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:31:09,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {14043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:31:09,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {14047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14051#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {14051#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14055#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {14055#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14059#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:09,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {14059#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:31:09,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {14063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:31:09,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {14067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:31:09,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {14071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !(~i~0 < ~SIZE~0); {13911#false} is VALID [2022-04-28 10:31:09,112 INFO L272 TraceCheckUtils]: 42: Hoare triple {13911#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13911#false} is VALID [2022-04-28 10:31:09,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-28 10:31:09,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-28 10:31:09,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-28 10:31:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:09,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:31:13,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-28 10:31:13,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-28 10:31:13,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-28 10:31:13,755 INFO L272 TraceCheckUtils]: 42: Hoare triple {13911#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13911#false} is VALID [2022-04-28 10:31:13,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {14099#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {13911#false} is VALID [2022-04-28 10:31:13,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {14103#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14099#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:31:13,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {14107#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14103#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:31:13,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {14111#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14107#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:31:13,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {14115#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14111#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:31:13,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {14119#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14115#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:31:13,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {14123#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14119#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {14127#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14123#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:31:13,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {14131#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14127#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {14135#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14131#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:31:13,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14135#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:31:13,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {14143#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14139#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:31:13,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {14147#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14143#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:31:13,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {14151#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14147#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:31:13,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {14155#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14151#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:31:13,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {14159#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14155#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:31:13,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {14163#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14159#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:31:13,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {14167#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14163#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:31:13,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {14171#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14167#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:31:13,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {14175#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14171#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:31:13,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {14179#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14175#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {14183#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14179#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:31:13,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {14187#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14183#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:31:13,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {14191#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14187#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:31:13,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {14195#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14191#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {14199#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14195#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:31:13,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {14203#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14199#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:31:13,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {14207#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14203#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:31:13,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {14211#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14207#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:31:13,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {14215#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14211#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:31:13,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {14219#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14215#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {14223#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14219#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {14227#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14223#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:31:13,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {14231#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14227#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {14235#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14231#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:31:13,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {14239#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14235#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:31:13,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {14243#(< 35 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {14239#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:13,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {14243#(< 35 ~SIZE~0)} call #t~ret4 := main(); {14243#(< 35 ~SIZE~0)} is VALID [2022-04-28 10:31:13,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14243#(< 35 ~SIZE~0)} {13910#true} #45#return; {14243#(< 35 ~SIZE~0)} is VALID [2022-04-28 10:31:13,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {14243#(< 35 ~SIZE~0)} assume true; {14243#(< 35 ~SIZE~0)} is VALID [2022-04-28 10:31:13,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {13910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {14243#(< 35 ~SIZE~0)} is VALID [2022-04-28 10:31:13,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-28 10:31:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:31:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990685306] [2022-04-28 10:31:13,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:31:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826847769] [2022-04-28 10:31:13,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826847769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:31:13,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:31:13,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2022-04-28 10:31:13,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:31:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2124741408] [2022-04-28 10:31:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2124741408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:31:13,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:31:13,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 10:31:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884433164] [2022-04-28 10:31:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:31:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 10:31:13,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:31:13,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:13,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 10:31:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 10:31:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:31:13,827 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:28,818 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 10:31:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 10:31:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 10:31:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:31:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 10:31:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 10:31:28,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-28 10:31:28,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:28,869 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:31:28,869 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:31:28,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:31:28,870 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:31:28,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:31:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:31:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 10:31:28,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:31:28,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,915 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,915 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:28,916 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 10:31:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 10:31:28,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:28,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:28,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 10:31:28,917 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 10:31:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:28,917 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 10:31:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 10:31:28,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:28,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:28,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:31:28,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:31:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-28 10:31:28,919 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-28 10:31:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:31:28,919 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-28 10:31:28,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:28,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-28 10:31:28,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 10:31:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:31:28,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:31:28,959 INFO L195 NwaCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:31:28,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 10:31:29,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:29,159 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:31:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:31:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1548525419, now seen corresponding path program 71 times [2022-04-28 10:31:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:29,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291120985] [2022-04-28 10:31:29,163 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:31:29,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:31:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1548525419, now seen corresponding path program 72 times [2022-04-28 10:31:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:31:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887251024] [2022-04-28 10:31:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:31:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:31:29,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:31:29,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538135333] [2022-04-28 10:31:29,184 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:31:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:31:29,185 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:31:29,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 10:31:29,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 10:31:29,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:31:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:31:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:29,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:31:30,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {14559#true} call ULTIMATE.init(); {14559#true} is VALID [2022-04-28 10:31:30,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {14559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:30,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {14567#(<= 40000 ~SIZE~0)} assume true; {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:30,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14567#(<= 40000 ~SIZE~0)} {14559#true} #45#return; {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:30,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {14567#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:30,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {14567#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {14580#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {14580#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14584#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {14584#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14588#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:31:30,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {14588#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14592#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:31:30,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {14592#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14596#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:31:30,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {14596#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14600#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {14600#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14604#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:31:30,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {14604#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14608#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {14608#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14612#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:31:30,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {14612#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14616#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:31:30,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {14616#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14620#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {14620#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14624#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:31:30,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {14624#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14628#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:31:30,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {14628#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14632#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {14632#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14636#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {14636#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14640#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {14640#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14644#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {14644#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14648#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:31:30,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {14648#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14652#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {14652#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14656#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:31:30,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {14656#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14660#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:31:30,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {14660#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14664#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {14664#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14668#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:31:30,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {14668#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14672#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:31:30,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {14672#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14676#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:31:30,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {14676#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14680#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:31:30,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {14680#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14684#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:31:30,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {14684#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14688#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {14688#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14692#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:31:30,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {14692#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14696#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:31:30,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {14696#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14700#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {14700#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14704#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {14704#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14708#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:30,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {14708#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:31:30,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {14712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:31:30,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {14716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14720#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:31:30,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {14720#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:31:30,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {14724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !(~i~0 < ~SIZE~0); {14560#false} is VALID [2022-04-28 10:31:30,466 INFO L272 TraceCheckUtils]: 43: Hoare triple {14560#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {14560#false} is VALID [2022-04-28 10:31:30,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {14560#false} ~cond := #in~cond; {14560#false} is VALID [2022-04-28 10:31:30,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {14560#false} assume 0 == ~cond; {14560#false} is VALID [2022-04-28 10:31:30,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {14560#false} assume !false; {14560#false} is VALID [2022-04-28 10:31:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:30,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:31:35,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {14560#false} assume !false; {14560#false} is VALID [2022-04-28 10:31:35,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {14560#false} assume 0 == ~cond; {14560#false} is VALID [2022-04-28 10:31:35,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {14560#false} ~cond := #in~cond; {14560#false} is VALID [2022-04-28 10:31:35,794 INFO L272 TraceCheckUtils]: 43: Hoare triple {14560#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {14560#false} is VALID [2022-04-28 10:31:35,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {14752#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {14560#false} is VALID [2022-04-28 10:31:35,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {14756#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14752#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:31:35,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {14760#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14756#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:31:35,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {14764#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14760#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:31:35,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {14768#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14764#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:31:35,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {14772#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14768#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:31:35,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {14776#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14772#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {14780#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14776#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:31:35,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {14784#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14780#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {14788#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14784#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:31:35,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {14792#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14788#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:31:35,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {14796#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14792#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:31:35,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {14800#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14796#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:31:35,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {14804#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14800#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:31:35,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {14808#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14804#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:31:35,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {14812#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14808#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:31:35,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {14816#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14812#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:31:35,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {14820#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14816#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:31:35,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {14824#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14820#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:31:35,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {14828#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14824#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:31:35,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {14832#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14828#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {14836#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14832#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:31:35,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {14840#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14836#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:31:35,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {14844#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14840#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:31:35,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {14848#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14844#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {14852#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14848#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:31:35,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {14856#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14852#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:31:35,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {14860#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14856#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:31:35,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {14864#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14860#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:31:35,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {14868#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14864#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:31:35,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {14872#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14868#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {14876#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14872#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {14880#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14876#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:31:35,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {14884#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14880#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {14888#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14884#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:31:35,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {14892#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14888#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:31:35,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {14896#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14892#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:35,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {14900#(< 36 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {14896#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:31:35,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {14900#(< 36 ~SIZE~0)} call #t~ret4 := main(); {14900#(< 36 ~SIZE~0)} is VALID [2022-04-28 10:31:35,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14900#(< 36 ~SIZE~0)} {14559#true} #45#return; {14900#(< 36 ~SIZE~0)} is VALID [2022-04-28 10:31:35,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {14900#(< 36 ~SIZE~0)} assume true; {14900#(< 36 ~SIZE~0)} is VALID [2022-04-28 10:31:35,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {14559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {14900#(< 36 ~SIZE~0)} is VALID [2022-04-28 10:31:35,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {14559#true} call ULTIMATE.init(); {14559#true} is VALID [2022-04-28 10:31:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:31:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887251024] [2022-04-28 10:31:35,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:31:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538135333] [2022-04-28 10:31:35,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538135333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:31:35,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:31:35,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2022-04-28 10:31:35,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:31:35,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291120985] [2022-04-28 10:31:35,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291120985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:31:35,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:31:35,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 10:31:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040399987] [2022-04-28 10:31:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:31:35,837 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 10:31:35,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:31:35,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:35,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:35,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 10:31:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:35,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 10:31:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:31:35,875 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:42,194 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 10:31:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 10:31:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 10:31:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:31:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 10:31:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 10:31:42,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-28 10:31:42,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:42,267 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:31:42,267 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:31:42,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:31:42,268 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:31:42,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:31:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:31:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 10:31:42,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:31:42,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,313 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,314 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:42,314 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 10:31:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 10:31:42,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:42,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:42,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 10:31:42,315 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 10:31:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:42,316 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 10:31:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 10:31:42,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:42,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:42,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:31:42,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:31:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 10:31:42,317 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-28 10:31:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:31:42,317 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 10:31:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:42,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 10:31:42,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 10:31:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:31:42,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:31:42,371 INFO L195 NwaCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:31:42,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 10:31:42,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 10:31:42,571 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:31:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:31:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash 794142802, now seen corresponding path program 73 times [2022-04-28 10:31:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:42,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591873102] [2022-04-28 10:31:42,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:31:42,576 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:31:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 794142802, now seen corresponding path program 74 times [2022-04-28 10:31:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:31:42,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647183221] [2022-04-28 10:31:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:31:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:31:42,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:31:42,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899215095] [2022-04-28 10:31:42,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:31:42,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:31:42,597 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:31:42,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 10:31:42,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:31:42,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:31:42,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:31:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:42,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:31:43,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {15222#true} call ULTIMATE.init(); {15222#true} is VALID [2022-04-28 10:31:43,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {15222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:43,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {15230#(<= 40000 ~SIZE~0)} assume true; {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:43,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15230#(<= 40000 ~SIZE~0)} {15222#true} #45#return; {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:43,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {15230#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:31:43,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {15230#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {15243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {15243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {15247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:31:43,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {15251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:31:43,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {15255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:31:43,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {15259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {15263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:31:43,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {15267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {15271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:31:43,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {15275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:31:43,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {15279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {15283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:31:43,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {15287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:31:43,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {15291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {15295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {15299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {15303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {15307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:31:43,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {15311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {15315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:31:43,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {15319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:31:43,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {15323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {15327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:31:43,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {15331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:31:43,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {15335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:31:43,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {15339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:31:43,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {15343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:31:43,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {15347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {15351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:31:43,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {15355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:31:43,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {15359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15363#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {15363#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15367#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {15367#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15371#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:31:43,991 INFO L290 TraceCheckUtils]: 38: Hoare triple {15371#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:31:43,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {15375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:31:43,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {15379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:31:43,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {15383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15387#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:31:43,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {15387#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:31:44,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {15391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !(~i~0 < ~SIZE~0); {15223#false} is VALID [2022-04-28 10:31:44,000 INFO L272 TraceCheckUtils]: 44: Hoare triple {15223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15223#false} is VALID [2022-04-28 10:31:44,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {15223#false} ~cond := #in~cond; {15223#false} is VALID [2022-04-28 10:31:44,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {15223#false} assume 0 == ~cond; {15223#false} is VALID [2022-04-28 10:31:44,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {15223#false} assume !false; {15223#false} is VALID [2022-04-28 10:31:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:44,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:31:50,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {15223#false} assume !false; {15223#false} is VALID [2022-04-28 10:31:50,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {15223#false} assume 0 == ~cond; {15223#false} is VALID [2022-04-28 10:31:50,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {15223#false} ~cond := #in~cond; {15223#false} is VALID [2022-04-28 10:31:50,334 INFO L272 TraceCheckUtils]: 44: Hoare triple {15223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15223#false} is VALID [2022-04-28 10:31:50,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {15419#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {15223#false} is VALID [2022-04-28 10:31:50,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {15423#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15419#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:31:50,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {15427#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15423#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:31:50,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {15431#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15427#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:31:50,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {15435#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15431#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:31:50,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {15439#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15435#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:31:50,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {15443#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15439#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {15447#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15443#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:31:50,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {15451#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15447#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {15455#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15451#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:31:50,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {15459#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15455#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:31:50,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {15463#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15459#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:31:50,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {15467#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15463#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:31:50,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {15471#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15467#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:31:50,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {15475#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15471#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:31:50,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {15479#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15475#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:31:50,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {15483#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15479#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:31:50,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {15487#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15483#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:31:50,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {15491#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15487#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:31:50,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {15495#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15491#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:31:50,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {15499#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15495#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {15503#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15499#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:31:50,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {15507#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15503#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:31:50,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {15511#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15507#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:31:50,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {15515#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15511#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {15519#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15515#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:31:50,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {15523#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15519#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:31:50,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {15527#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15523#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:31:50,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {15531#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15527#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:31:50,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {15535#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15531#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:31:50,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {15539#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15535#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {15543#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15539#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {15547#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15543#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:31:50,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {15551#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15547#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {15555#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15551#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:31:50,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {15559#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15555#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:31:50,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {15563#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15559#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:31:50,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {15567#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15563#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:31:50,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {15571#(< 37 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {15567#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:31:50,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {15571#(< 37 ~SIZE~0)} call #t~ret4 := main(); {15571#(< 37 ~SIZE~0)} is VALID [2022-04-28 10:31:50,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15571#(< 37 ~SIZE~0)} {15222#true} #45#return; {15571#(< 37 ~SIZE~0)} is VALID [2022-04-28 10:31:50,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {15571#(< 37 ~SIZE~0)} assume true; {15571#(< 37 ~SIZE~0)} is VALID [2022-04-28 10:31:50,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {15222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {15571#(< 37 ~SIZE~0)} is VALID [2022-04-28 10:31:50,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {15222#true} call ULTIMATE.init(); {15222#true} is VALID [2022-04-28 10:31:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:31:50,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647183221] [2022-04-28 10:31:50,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:31:50,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899215095] [2022-04-28 10:31:50,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899215095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:31:50,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:31:50,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 80 [2022-04-28 10:31:50,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:31:50,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591873102] [2022-04-28 10:31:50,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591873102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:31:50,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:31:50,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 10:31:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867919564] [2022-04-28 10:31:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:31:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 10:31:50,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:31:50,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:50,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:50,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 10:31:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:50,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 10:31:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:31:50,432 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:58,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:32:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:02,777 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 10:32:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 10:32:02,777 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 10:32:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:32:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 10:32:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 10:32:02,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-28 10:32:02,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:02,829 INFO L225 Difference]: With dead ends: 55 [2022-04-28 10:32:02,829 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 10:32:02,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:32:02,830 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:32:02,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:32:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 10:32:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 10:32:02,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:32:02,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,872 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,872 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:02,872 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 10:32:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 10:32:02,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:02,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:02,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 10:32:02,873 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 10:32:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:02,873 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 10:32:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 10:32:02,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:02,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:02,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:32:02,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:32:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-28 10:32:02,874 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-28 10:32:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:32:02,874 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-28 10:32:02,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:02,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-28 10:32:02,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 10:32:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:32:02,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:32:02,923 INFO L195 NwaCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:32:02,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 10:32:03,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 10:32:03,145 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:32:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:32:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1116881845, now seen corresponding path program 75 times [2022-04-28 10:32:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:03,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920710048] [2022-04-28 10:32:03,148 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:32:03,148 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:32:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1116881845, now seen corresponding path program 76 times [2022-04-28 10:32:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:32:03,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063976351] [2022-04-28 10:32:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:32:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:32:03,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:32:03,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528202404] [2022-04-28 10:32:03,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:32:03,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:32:03,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:32:03,169 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:32:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 10:32:03,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:32:03,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:32:03,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:32:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:03,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:32:04,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {15899#true} call ULTIMATE.init(); {15899#true} is VALID [2022-04-28 10:32:04,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {15899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:04,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {15907#(<= 40000 ~SIZE~0)} assume true; {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:04,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15907#(<= 40000 ~SIZE~0)} {15899#true} #45#return; {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:04,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {15907#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:04,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {15907#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {15920#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {15920#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15924#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {15924#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:32:04,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {15928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:32:04,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {15932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:32:04,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {15936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15940#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:32:04,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {15944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15948#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {15948#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:32:04,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {15952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:32:04,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {15956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15960#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {15960#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:32:04,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {15964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15968#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:32:04,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {15968#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15972#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {15972#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15976#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {15976#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15980#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {15980#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15984#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {15984#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:32:04,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {15988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15992#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {15992#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:32:04,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {15996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:32:04,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {16000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16004#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {16004#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:32:04,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {16008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:32:04,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {16012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:32:04,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {16016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:32:04,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {16020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:32:04,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {16024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16028#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {16028#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16032#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:32:04,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {16032#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16036#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:32:04,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {16036#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16040#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {16040#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16044#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {16044#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16048#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {16048#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:32:04,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {16052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:32:04,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {16056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16060#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:32:04,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {16060#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:32:04,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {16064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16068#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:32:04,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {16068#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16072#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:04,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {16072#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {15900#false} is VALID [2022-04-28 10:32:04,475 INFO L272 TraceCheckUtils]: 45: Hoare triple {15900#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15900#false} is VALID [2022-04-28 10:32:04,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {15900#false} ~cond := #in~cond; {15900#false} is VALID [2022-04-28 10:32:04,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {15900#false} assume 0 == ~cond; {15900#false} is VALID [2022-04-28 10:32:04,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {15900#false} assume !false; {15900#false} is VALID [2022-04-28 10:32:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:04,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:32:12,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {15900#false} assume !false; {15900#false} is VALID [2022-04-28 10:32:12,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {15900#false} assume 0 == ~cond; {15900#false} is VALID [2022-04-28 10:32:12,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {15900#false} ~cond := #in~cond; {15900#false} is VALID [2022-04-28 10:32:12,490 INFO L272 TraceCheckUtils]: 45: Hoare triple {15900#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15900#false} is VALID [2022-04-28 10:32:12,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {16100#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {15900#false} is VALID [2022-04-28 10:32:12,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {16104#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16100#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:32:12,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {16108#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16104#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:32:12,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {16112#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16108#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:32:12,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {16116#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16112#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:32:12,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {16120#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16116#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:32:12,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {16124#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16120#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {16128#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16124#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:32:12,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {16132#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16128#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {16136#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16132#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:32:12,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {16140#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16136#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:32:12,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {16144#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16140#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:32:12,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {16148#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16144#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:32:12,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {16152#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16148#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:32:12,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {16156#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16152#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:32:12,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {16160#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16156#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:32:12,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {16164#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16160#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:32:12,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {16168#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16164#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:32:12,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {16172#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16168#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:32:12,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {16176#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16172#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:32:12,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16176#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {16184#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16180#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:32:12,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {16188#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16184#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:32:12,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {16192#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16188#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:32:12,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {16196#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16192#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {16200#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16196#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:32:12,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {16204#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16200#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:32:12,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {16208#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16204#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:32:12,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {16212#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16208#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:32:12,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {16216#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16212#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:32:12,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {16220#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16216#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {16224#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16220#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {16228#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16224#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:32:12,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {16232#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16228#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {16236#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16232#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:32:12,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {16240#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16236#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:32:12,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {16244#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16240#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:12,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {16248#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16244#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:32:12,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {16252#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16248#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:32:12,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {16256#(< 38 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {16252#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:32:12,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {16256#(< 38 ~SIZE~0)} call #t~ret4 := main(); {16256#(< 38 ~SIZE~0)} is VALID [2022-04-28 10:32:12,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16256#(< 38 ~SIZE~0)} {15899#true} #45#return; {16256#(< 38 ~SIZE~0)} is VALID [2022-04-28 10:32:12,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {16256#(< 38 ~SIZE~0)} assume true; {16256#(< 38 ~SIZE~0)} is VALID [2022-04-28 10:32:12,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {15899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {16256#(< 38 ~SIZE~0)} is VALID [2022-04-28 10:32:12,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {15899#true} call ULTIMATE.init(); {15899#true} is VALID [2022-04-28 10:32:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:32:12,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063976351] [2022-04-28 10:32:12,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:32:12,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528202404] [2022-04-28 10:32:12,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528202404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:32:12,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:32:12,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 82 [2022-04-28 10:32:12,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:32:12,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920710048] [2022-04-28 10:32:12,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920710048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:32:12,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:32:12,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 10:32:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120224093] [2022-04-28 10:32:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:32:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 10:32:12,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:32:12,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:12,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:12,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 10:32:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 10:32:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:32:12,577 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:18,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:32:20,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:32:22,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:32:26,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:32:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:29,026 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 10:32:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 10:32:29,026 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 10:32:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:32:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 10:32:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 10:32:29,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-28 10:32:29,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:29,094 INFO L225 Difference]: With dead ends: 56 [2022-04-28 10:32:29,094 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:32:29,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:32:29,096 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 42 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:32:29,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 74 Invalid, 4 Unknown, 0 Unchecked, 8.2s Time] [2022-04-28 10:32:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:32:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 10:32:29,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:32:29,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,138 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,138 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:29,138 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 10:32:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 10:32:29,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:29,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:29,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 10:32:29,139 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 10:32:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:29,139 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 10:32:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 10:32:29,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:29,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:29,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:32:29,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:32:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 10:32:29,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-28 10:32:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:32:29,141 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 10:32:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:29,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 10:32:29,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 10:32:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:32:29,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:32:29,210 INFO L195 NwaCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:32:29,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:32:29,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:32:29,410 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:32:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:32:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash -229103758, now seen corresponding path program 77 times [2022-04-28 10:32:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:29,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461555096] [2022-04-28 10:32:29,415 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:32:29,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:32:29,415 INFO L85 PathProgramCache]: Analyzing trace with hash -229103758, now seen corresponding path program 78 times [2022-04-28 10:32:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:32:29,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467100908] [2022-04-28 10:32:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:32:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:32:29,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:32:29,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80333478] [2022-04-28 10:32:29,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:32:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:32:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:32:29,436 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:32:29,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 10:32:29,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-28 10:32:29,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:32:29,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:32:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:29,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:32:30,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {16590#true} call ULTIMATE.init(); {16590#true} is VALID [2022-04-28 10:32:30,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {16590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:30,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {16598#(<= 40000 ~SIZE~0)} assume true; {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:30,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16598#(<= 40000 ~SIZE~0)} {16590#true} #45#return; {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:30,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {16598#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:30,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {16598#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {16611#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {16611#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16615#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {16615#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:32:30,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {16619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16623#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:32:30,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {16623#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:32:30,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {16627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16631#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {16631#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16635#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:32:30,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {16635#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16639#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {16639#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16643#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:32:30,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {16643#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:32:30,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {16647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16651#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {16651#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:32:30,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {16655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:32:30,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {16659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16663#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {16663#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16667#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {16667#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16671#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {16671#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16675#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {16675#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:32:30,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {16679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16683#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {16683#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:32:30,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {16687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:32:30,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {16691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16695#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {16695#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:32:30,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {16699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16703#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:32:30,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {16703#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:32:30,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {16707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:32:30,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {16711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16715#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:32:30,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {16715#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16719#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {16719#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:32:30,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {16723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16727#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:32:30,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {16727#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16731#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {16731#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16735#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {16735#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16739#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {16739#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:32:30,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {16743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:32:30,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {16747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:32:30,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {16751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:32:30,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {16755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:32:30,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {16759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16763#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:30,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {16763#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:32:30,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {16767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !(~i~0 < ~SIZE~0); {16591#false} is VALID [2022-04-28 10:32:30,847 INFO L272 TraceCheckUtils]: 46: Hoare triple {16591#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {16591#false} is VALID [2022-04-28 10:32:30,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {16591#false} ~cond := #in~cond; {16591#false} is VALID [2022-04-28 10:32:30,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {16591#false} assume 0 == ~cond; {16591#false} is VALID [2022-04-28 10:32:30,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {16591#false} assume !false; {16591#false} is VALID [2022-04-28 10:32:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:30,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:32:41,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {16591#false} assume !false; {16591#false} is VALID [2022-04-28 10:32:41,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {16591#false} assume 0 == ~cond; {16591#false} is VALID [2022-04-28 10:32:41,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {16591#false} ~cond := #in~cond; {16591#false} is VALID [2022-04-28 10:32:41,408 INFO L272 TraceCheckUtils]: 46: Hoare triple {16591#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {16591#false} is VALID [2022-04-28 10:32:41,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {16795#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {16591#false} is VALID [2022-04-28 10:32:41,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {16799#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16795#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:32:41,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {16803#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16799#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:32:41,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {16807#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16803#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:32:41,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {16811#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16807#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:32:41,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {16815#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16811#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:32:41,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {16819#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16815#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {16823#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16819#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:32:41,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {16827#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16823#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {16831#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16827#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:32:41,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {16835#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16831#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:32:41,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {16839#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16835#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:32:41,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {16843#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16839#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:32:41,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {16847#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16843#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:32:41,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {16851#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16847#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:32:41,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {16855#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16851#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:32:41,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {16859#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16855#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:32:41,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {16863#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16859#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:32:41,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16863#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:32:41,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {16871#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16867#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:32:41,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16871#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {16879#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16875#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:32:41,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {16883#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16879#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:32:41,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {16887#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16883#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:32:41,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {16891#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16887#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {16895#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16891#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:32:41,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {16899#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16895#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:32:41,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {16903#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16899#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:32:41,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {16907#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16903#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:32:41,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {16911#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16907#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:32:41,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {16915#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16911#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {16919#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16915#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {16923#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16919#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:32:41,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {16927#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16923#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {16931#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16927#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:32:41,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {16935#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16931#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:32:41,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {16939#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16935#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:32:41,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {16943#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16939#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:32:41,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {16947#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16943#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:32:41,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {16951#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16947#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:32:41,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {16955#(< 39 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {16951#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:32:41,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {16955#(< 39 ~SIZE~0)} call #t~ret4 := main(); {16955#(< 39 ~SIZE~0)} is VALID [2022-04-28 10:32:41,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16955#(< 39 ~SIZE~0)} {16590#true} #45#return; {16955#(< 39 ~SIZE~0)} is VALID [2022-04-28 10:32:41,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {16955#(< 39 ~SIZE~0)} assume true; {16955#(< 39 ~SIZE~0)} is VALID [2022-04-28 10:32:41,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {16590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {16955#(< 39 ~SIZE~0)} is VALID [2022-04-28 10:32:41,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {16590#true} call ULTIMATE.init(); {16590#true} is VALID [2022-04-28 10:32:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:32:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467100908] [2022-04-28 10:32:41,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:32:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80333478] [2022-04-28 10:32:41,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80333478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:32:41,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:32:41,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 84 [2022-04-28 10:32:41,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:32:41,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461555096] [2022-04-28 10:32:41,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461555096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:32:41,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:32:41,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 10:32:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444242428] [2022-04-28 10:32:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:32:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 10:32:41,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:32:41,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:41,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:41,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 10:32:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 10:32:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 10:32:41,495 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:49,913 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 10:32:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:32:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 10:32:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:32:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 10:32:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 10:32:49,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-28 10:32:49,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:49,979 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:32:49,979 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:32:49,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 10:32:49,980 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:32:49,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:32:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:32:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 10:32:50,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:32:50,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:50,028 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:50,028 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:50,029 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 10:32:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 10:32:50,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:50,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:50,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 10:32:50,029 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 10:32:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:50,030 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 10:32:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 10:32:50,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:50,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:50,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:32:50,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:32:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-28 10:32:50,031 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-28 10:32:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:32:50,031 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-28 10:32:50,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:50,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-28 10:32:50,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 10:32:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 10:32:50,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:32:50,080 INFO L195 NwaCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:32:50,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 10:32:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:32:50,284 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:32:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:32:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1522213163, now seen corresponding path program 79 times [2022-04-28 10:32:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909197905] [2022-04-28 10:32:50,286 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:32:50,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:32:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1522213163, now seen corresponding path program 80 times [2022-04-28 10:32:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:32:50,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947432623] [2022-04-28 10:32:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:32:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:32:50,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:32:50,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997240724] [2022-04-28 10:32:50,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:32:50,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:32:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:32:50,306 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:32:50,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 10:32:50,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:32:50,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:32:50,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:32:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:50,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:32:51,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {17295#true} call ULTIMATE.init(); {17295#true} is VALID [2022-04-28 10:32:51,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {17295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:51,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {17303#(<= 40000 ~SIZE~0)} assume true; {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:51,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17303#(<= 40000 ~SIZE~0)} {17295#true} #45#return; {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:51,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {17303#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:32:51,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {17303#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {17316#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {17316#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17320#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {17320#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:32:51,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {17324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:32:51,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {17328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:32:51,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {17332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17336#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {17336#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:32:51,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {17340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17344#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {17344#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17348#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:32:51,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {17348#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:32:51,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {17352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17356#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {17356#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17360#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:32:51,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {17360#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:32:51,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {17364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17368#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {17368#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17372#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {17372#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17376#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {17376#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17380#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {17380#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:32:51,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {17384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17388#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {17388#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:32:51,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {17392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:32:51,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {17396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17400#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {17400#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17404#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:32:51,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {17404#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:32:51,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {17408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:32:51,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {17412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:32:51,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {17416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:32:51,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {17420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17424#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {17424#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:32:51,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {17428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:32:51,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {17432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17436#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {17436#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17440#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {17440#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17444#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {17444#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:32:51,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {17448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:32:51,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {17452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17456#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:32:51,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {17456#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17460#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:32:51,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17464#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:32:51,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {17464#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17468#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:32:51,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {17468#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17472#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:32:51,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {17472#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17476#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:32:51,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {17476#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !(~i~0 < ~SIZE~0); {17296#false} is VALID [2022-04-28 10:32:51,765 INFO L272 TraceCheckUtils]: 47: Hoare triple {17296#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {17296#false} is VALID [2022-04-28 10:32:51,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {17296#false} ~cond := #in~cond; {17296#false} is VALID [2022-04-28 10:32:51,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {17296#false} assume 0 == ~cond; {17296#false} is VALID [2022-04-28 10:32:51,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {17296#false} assume !false; {17296#false} is VALID [2022-04-28 10:32:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:51,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:04,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {17296#false} assume !false; {17296#false} is VALID [2022-04-28 10:33:04,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {17296#false} assume 0 == ~cond; {17296#false} is VALID [2022-04-28 10:33:04,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {17296#false} ~cond := #in~cond; {17296#false} is VALID [2022-04-28 10:33:04,717 INFO L272 TraceCheckUtils]: 47: Hoare triple {17296#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {17296#false} is VALID [2022-04-28 10:33:04,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {17504#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {17296#false} is VALID [2022-04-28 10:33:04,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {17508#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17504#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:33:04,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {17512#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17508#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:33:04,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {17516#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17512#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:33:04,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {17520#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17516#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:33:04,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {17524#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17520#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:33:04,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {17528#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17524#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {17532#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17528#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:33:04,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {17536#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17532#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {17540#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17536#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:33:04,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {17544#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17540#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:33:04,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {17548#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17544#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:33:04,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {17552#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17548#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:33:04,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {17556#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17552#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:33:04,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {17560#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17556#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:33:04,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {17564#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17560#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:33:04,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {17568#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17564#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:33:04,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {17572#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17568#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:33:04,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {17576#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17572#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:33:04,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {17580#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17576#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:33:04,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {17584#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17580#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {17588#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17584#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:33:04,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {17592#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17588#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:33:04,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {17596#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17592#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:33:04,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {17600#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17596#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17600#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:33:04,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {17608#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17604#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:33:04,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {17612#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17608#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:33:04,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {17616#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17612#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:33:04,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {17620#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17616#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:33:04,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {17624#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17620#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {17628#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17624#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {17632#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17628#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:33:04,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {17636#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17632#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {17640#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17636#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:33:04,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {17644#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17640#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:33:04,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {17648#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17644#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {17652#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17648#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:33:04,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {17656#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17652#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:33:04,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {17660#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17656#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:33:04,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {17664#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17660#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:33:04,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {17668#(< 40 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {17664#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:04,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {17668#(< 40 ~SIZE~0)} call #t~ret4 := main(); {17668#(< 40 ~SIZE~0)} is VALID [2022-04-28 10:33:04,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17668#(< 40 ~SIZE~0)} {17295#true} #45#return; {17668#(< 40 ~SIZE~0)} is VALID [2022-04-28 10:33:04,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {17668#(< 40 ~SIZE~0)} assume true; {17668#(< 40 ~SIZE~0)} is VALID [2022-04-28 10:33:04,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {17295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {17668#(< 40 ~SIZE~0)} is VALID [2022-04-28 10:33:04,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {17295#true} call ULTIMATE.init(); {17295#true} is VALID [2022-04-28 10:33:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:04,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947432623] [2022-04-28 10:33:04,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:33:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997240724] [2022-04-28 10:33:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997240724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:04,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:33:04,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2022-04-28 10:33:04,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909197905] [2022-04-28 10:33:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909197905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:04,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:04,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 10:33:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157549383] [2022-04-28 10:33:04,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 10:33:04,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:04,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:04,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:04,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 10:33:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:04,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 10:33:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 10:33:04,827 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:07,874 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 10:33:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 10:33:07,874 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 10:33:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 10:33:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 10:33:07,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-28 10:33:07,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:07,937 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:33:07,938 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:33:07,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 10:33:07,939 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:07,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:33:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:33:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 10:33:07,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:07,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,980 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,980 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:07,981 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 10:33:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 10:33:07,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:07,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:07,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 10:33:07,982 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 10:33:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:07,982 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 10:33:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 10:33:07,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:07,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:07,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:07,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 10:33:07,984 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-28 10:33:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:07,984 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 10:33:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:07,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 10:33:08,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 10:33:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 10:33:08,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:08,043 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:08,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:08,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:08,244 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -21537134, now seen corresponding path program 81 times [2022-04-28 10:33:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:08,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10792157] [2022-04-28 10:33:08,247 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:08,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash -21537134, now seen corresponding path program 82 times [2022-04-28 10:33:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:08,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469725336] [2022-04-28 10:33:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:08,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:33:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678054630] [2022-04-28 10:33:08,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:08,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:08,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:08,269 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:08,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 10:33:08,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:08,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:08,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:33:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:08,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:09,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {18014#true} call ULTIMATE.init(); {18014#true} is VALID [2022-04-28 10:33:09,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {18014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:09,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {18022#(<= 40000 ~SIZE~0)} assume true; {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:09,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18022#(<= 40000 ~SIZE~0)} {18014#true} #45#return; {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:09,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {18022#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:09,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {18022#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {18035#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {18035#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18039#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {18039#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:33:09,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {18043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:33:09,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {18047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18051#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:33:09,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {18051#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18055#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {18055#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:33:09,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {18059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18063#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {18063#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:33:09,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {18067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:33:09,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {18071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18075#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {18075#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18079#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:33:09,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {18079#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:33:09,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {18083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18087#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {18087#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18091#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18095#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {18095#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18099#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {18099#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18103#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:33:09,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {18103#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18107#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {18107#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18111#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:33:09,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {18111#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18115#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:33:09,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {18115#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18119#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {18119#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18123#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:33:09,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {18123#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:33:09,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {18127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:33:09,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {18131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18135#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:33:09,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {18135#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:33:09,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {18139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18143#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {18143#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:33:09,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {18147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:33:09,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {18151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18155#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {18155#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18159#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {18159#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18163#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {18163#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:33:09,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {18167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18171#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:33:09,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {18171#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18175#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:33:09,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {18175#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18179#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:33:09,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {18179#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:33:09,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {18183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18187#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {18187#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:33:09,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {18191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:33:09,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {18195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18199#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:09,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {18199#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {18015#false} is VALID [2022-04-28 10:33:09,759 INFO L272 TraceCheckUtils]: 48: Hoare triple {18015#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18015#false} is VALID [2022-04-28 10:33:09,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {18015#false} ~cond := #in~cond; {18015#false} is VALID [2022-04-28 10:33:09,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {18015#false} assume 0 == ~cond; {18015#false} is VALID [2022-04-28 10:33:09,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {18015#false} assume !false; {18015#false} is VALID [2022-04-28 10:33:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:09,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:21,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {18015#false} assume !false; {18015#false} is VALID [2022-04-28 10:33:21,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {18015#false} assume 0 == ~cond; {18015#false} is VALID [2022-04-28 10:33:21,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {18015#false} ~cond := #in~cond; {18015#false} is VALID [2022-04-28 10:33:21,694 INFO L272 TraceCheckUtils]: 48: Hoare triple {18015#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18015#false} is VALID [2022-04-28 10:33:21,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {18227#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {18015#false} is VALID [2022-04-28 10:33:21,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {18231#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18227#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:33:21,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {18235#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18231#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:33:21,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {18239#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18235#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:33:21,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {18243#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18239#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:33:21,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {18247#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18243#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:33:21,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {18251#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18247#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {18255#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18251#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:33:21,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {18259#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18255#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {18263#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18259#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:33:21,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {18267#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18263#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:33:21,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {18271#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18267#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:33:21,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {18275#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18271#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:33:21,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {18279#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18275#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:33:21,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {18283#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18279#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:33:21,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {18287#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18283#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:33:21,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {18291#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18287#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:33:21,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {18295#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18291#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:33:21,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {18299#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18295#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:33:21,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {18303#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18299#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:33:21,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {18307#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18303#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {18311#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18307#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:33:21,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {18315#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18311#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:33:21,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {18319#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18315#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:33:21,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {18323#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18319#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {18327#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18323#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:33:21,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {18331#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18327#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:33:21,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {18335#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18331#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:33:21,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {18339#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18335#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:33:21,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {18343#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18339#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:33:21,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {18347#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18343#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {18351#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18347#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {18355#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18351#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:33:21,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {18359#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18355#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {18363#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18359#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:33:21,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {18367#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18363#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:33:21,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {18371#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18367#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {18375#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18371#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:33:21,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {18379#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18375#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:33:21,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {18383#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18379#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:33:21,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {18387#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18383#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:33:21,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {18391#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18387#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {18395#(< 41 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {18391#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:21,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {18395#(< 41 ~SIZE~0)} call #t~ret4 := main(); {18395#(< 41 ~SIZE~0)} is VALID [2022-04-28 10:33:21,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18395#(< 41 ~SIZE~0)} {18014#true} #45#return; {18395#(< 41 ~SIZE~0)} is VALID [2022-04-28 10:33:21,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {18395#(< 41 ~SIZE~0)} assume true; {18395#(< 41 ~SIZE~0)} is VALID [2022-04-28 10:33:21,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {18014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {18395#(< 41 ~SIZE~0)} is VALID [2022-04-28 10:33:21,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {18014#true} call ULTIMATE.init(); {18014#true} is VALID [2022-04-28 10:33:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469725336] [2022-04-28 10:33:21,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:33:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678054630] [2022-04-28 10:33:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678054630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:21,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:33:21,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 88 [2022-04-28 10:33:21,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10792157] [2022-04-28 10:33:21,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10792157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:21,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:21,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 10:33:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408599556] [2022-04-28 10:33:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 10:33:21,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:21,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:21,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:21,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 10:33:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 10:33:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:33:21,795 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:30,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:33:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:31,096 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 10:33:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 10:33:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 10:33:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 10:33:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 10:33:31,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-28 10:33:31,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:31,175 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:33:31,176 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 10:33:31,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:33:31,177 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:31,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 63 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 10:33:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 10:33:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 10:33:31,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:31,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,225 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,225 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:31,226 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 10:33:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 10:33:31,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:31,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:31,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 10:33:31,226 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 10:33:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:31,227 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 10:33:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 10:33:31,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:31,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:31,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:31,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-28 10:33:31,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-28 10:33:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:31,229 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-28 10:33:31,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:31,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-28 10:33:31,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 10:33:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 10:33:31,288 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:31,289 INFO L195 NwaCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:31,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:31,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:31,489 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:31,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash -633156085, now seen corresponding path program 83 times [2022-04-28 10:33:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:31,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928210822] [2022-04-28 10:33:31,493 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:31,493 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash -633156085, now seen corresponding path program 84 times [2022-04-28 10:33:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:31,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752879872] [2022-04-28 10:33:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:31,517 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:33:31,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449957744] [2022-04-28 10:33:31,517 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:31,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:31,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:31,518 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:31,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 10:33:31,603 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 10:33:31,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:31,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:33:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:31,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:32,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {18747#true} call ULTIMATE.init(); {18747#true} is VALID [2022-04-28 10:33:32,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {18747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:32,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {18755#(<= 40000 ~SIZE~0)} assume true; {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:32,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18755#(<= 40000 ~SIZE~0)} {18747#true} #45#return; {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:32,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {18755#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:33:32,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {18755#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {18768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {18768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {18772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:33:32,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {18776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:33:32,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {18780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:33:32,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {18784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {18788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:33:32,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {18792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {18796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:33:32,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {18800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:33:32,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {18804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {18808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:33:32,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {18812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:33:32,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {18816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {18820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {18824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {18828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {18832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:33:32,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {18836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:32,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {18840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:33:32,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {18844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:33:33,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {18848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {18852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:33:33,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {18856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:33:33,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {18860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:33:33,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {18864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:33:33,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {18868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:33:33,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {18872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18876#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {18876#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:33:33,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {18880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:33:33,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {18884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18888#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {18888#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18892#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {18892#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18896#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {18896#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:33:33,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {18900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:33:33,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {18904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:33:33,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {18908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:33:33,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {18912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:33:33,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {18916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18920#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {18920#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:33:33,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {18924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:33:33,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {18928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18932#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:33:33,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {18932#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:33:33,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {18936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !(~i~0 < ~SIZE~0); {18748#false} is VALID [2022-04-28 10:33:33,033 INFO L272 TraceCheckUtils]: 49: Hoare triple {18748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18748#false} is VALID [2022-04-28 10:33:33,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {18748#false} ~cond := #in~cond; {18748#false} is VALID [2022-04-28 10:33:33,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {18748#false} assume 0 == ~cond; {18748#false} is VALID [2022-04-28 10:33:33,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {18748#false} assume !false; {18748#false} is VALID [2022-04-28 10:33:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:33,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:48,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {18748#false} assume !false; {18748#false} is VALID [2022-04-28 10:33:48,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {18748#false} assume 0 == ~cond; {18748#false} is VALID [2022-04-28 10:33:48,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {18748#false} ~cond := #in~cond; {18748#false} is VALID [2022-04-28 10:33:48,470 INFO L272 TraceCheckUtils]: 49: Hoare triple {18748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18748#false} is VALID [2022-04-28 10:33:48,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {18964#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {18748#false} is VALID [2022-04-28 10:33:48,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {18968#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18964#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:33:48,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {18972#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18968#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:33:48,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {18976#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18972#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:33:48,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {18980#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18976#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:33:48,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {18984#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18980#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:33:48,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {18988#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18984#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {18992#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18988#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:33:48,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {18996#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18992#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {19000#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18996#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:33:48,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {19004#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19000#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:33:48,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {19008#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19004#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:33:48,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {19012#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19008#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:33:48,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {19016#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19012#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:33:48,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {19020#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19016#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:33:48,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {19024#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19020#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:33:48,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {19028#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19024#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:33:48,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {19032#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19028#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:33:48,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {19036#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19032#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:33:48,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {19040#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19036#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:33:48,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {19044#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19040#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {19048#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19044#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:33:48,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {19052#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19048#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:33:48,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {19056#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19052#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:33:48,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {19060#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19056#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {19064#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19060#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:33:48,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {19068#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19064#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:33:48,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {19072#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19068#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:33:48,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {19076#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19072#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:33:48,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {19080#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19076#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:33:48,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {19084#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19080#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {19088#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19084#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {19092#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19088#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:33:48,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {19096#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19092#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {19100#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19096#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:33:48,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {19104#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19100#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:33:48,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {19108#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19104#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {19112#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19108#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:33:48,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {19116#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19112#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:33:48,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {19120#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19116#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:33:48,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {19124#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19120#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:33:48,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {19128#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19124#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {19132#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19128#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {19136#(< 42 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {19132#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:33:48,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {19136#(< 42 ~SIZE~0)} call #t~ret4 := main(); {19136#(< 42 ~SIZE~0)} is VALID [2022-04-28 10:33:48,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19136#(< 42 ~SIZE~0)} {18747#true} #45#return; {19136#(< 42 ~SIZE~0)} is VALID [2022-04-28 10:33:48,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {19136#(< 42 ~SIZE~0)} assume true; {19136#(< 42 ~SIZE~0)} is VALID [2022-04-28 10:33:48,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {18747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {19136#(< 42 ~SIZE~0)} is VALID [2022-04-28 10:33:48,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {18747#true} call ULTIMATE.init(); {18747#true} is VALID [2022-04-28 10:33:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:48,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752879872] [2022-04-28 10:33:48,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:33:48,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449957744] [2022-04-28 10:33:48,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449957744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:48,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:33:48,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 90 [2022-04-28 10:33:48,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928210822] [2022-04-28 10:33:48,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928210822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 10:33:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833744132] [2022-04-28 10:33:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 10:33:48,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 10:33:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 10:33:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 10:33:48,570 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:58,965 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 10:33:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 10:33:58,965 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 10:33:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 10:33:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 10:33:58,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-28 10:33:59,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:59,047 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:33:59,047 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 10:33:59,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 10:33:59,048 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:59,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:33:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 10:33:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 10:33:59,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:59,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:59,100 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:59,100 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:59,101 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 10:33:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 10:33:59,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:59,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:59,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 10:33:59,102 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 10:33:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:59,103 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 10:33:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 10:33:59,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:59,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:59,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:59,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 10:33:59,105 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-28 10:33:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:59,105 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 10:33:59,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:59,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 10:33:59,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 10:33:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 10:33:59,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:59,174 INFO L195 NwaCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:59,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:59,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 10:33:59,375 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1881492914, now seen corresponding path program 85 times [2022-04-28 10:33:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:59,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414743537] [2022-04-28 10:33:59,378 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:59,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1881492914, now seen corresponding path program 86 times [2022-04-28 10:33:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:59,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044533825] [2022-04-28 10:33:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:59,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:33:59,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429632261] [2022-04-28 10:33:59,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:59,401 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:59,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 10:33:59,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:59,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:59,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 10:33:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:59,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:00,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {19494#true} call ULTIMATE.init(); {19494#true} is VALID [2022-04-28 10:34:00,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:00,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {19502#(<= 40000 ~SIZE~0)} assume true; {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:00,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19502#(<= 40000 ~SIZE~0)} {19494#true} #45#return; {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:00,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {19502#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:00,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {19502#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {19515#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {19515#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19519#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {19519#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:34:00,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {19523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:34:00,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {19527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19531#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:34:00,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {19531#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19535#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {19535#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19539#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:34:00,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {19539#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19543#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {19543#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19547#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:34:00,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {19547#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:34:00,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {19551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19555#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {19555#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19559#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:34:00,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {19559#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:34:00,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {19563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19567#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {19567#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19571#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {19571#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19575#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {19575#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19579#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {19579#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19583#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:34:00,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {19583#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19587#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {19587#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:34:00,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {19591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19595#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:34:00,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {19595#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19599#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {19599#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19603#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:34:00,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {19603#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19607#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:34:00,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {19607#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19611#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:34:00,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {19611#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19615#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:34:00,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {19615#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:34:00,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {19619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19623#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {19623#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:34:00,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {19627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19631#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:34:00,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {19631#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19635#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {19635#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19639#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {19639#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19643#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {19643#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:34:00,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {19647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:34:00,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {19651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:34:00,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {19655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:34:00,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {19659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19663#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:34:00,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {19663#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19667#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {19667#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19671#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:34:00,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {19671#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:34:00,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {19675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19679#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:00,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {19679#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:34:00,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {19683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:34:00,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {19687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !(~i~0 < ~SIZE~0); {19495#false} is VALID [2022-04-28 10:34:00,934 INFO L272 TraceCheckUtils]: 50: Hoare triple {19495#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {19495#false} is VALID [2022-04-28 10:34:00,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {19495#false} ~cond := #in~cond; {19495#false} is VALID [2022-04-28 10:34:00,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {19495#false} assume 0 == ~cond; {19495#false} is VALID [2022-04-28 10:34:00,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-04-28 10:34:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:00,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:22,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-04-28 10:34:22,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {19495#false} assume 0 == ~cond; {19495#false} is VALID [2022-04-28 10:34:22,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {19495#false} ~cond := #in~cond; {19495#false} is VALID [2022-04-28 10:34:22,435 INFO L272 TraceCheckUtils]: 50: Hoare triple {19495#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {19495#false} is VALID [2022-04-28 10:34:22,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {19715#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {19495#false} is VALID [2022-04-28 10:34:22,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {19719#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19715#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:34:22,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {19723#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19719#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:34:22,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {19727#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19723#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:34:22,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {19731#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19727#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:34:22,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {19735#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19731#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:34:22,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {19739#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19735#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {19743#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19739#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:34:22,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {19747#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19743#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {19751#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19747#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:34:22,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {19755#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19751#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:34:22,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {19759#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19755#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:34:22,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {19763#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19759#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:34:22,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {19767#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19763#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:34:22,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {19771#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19767#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:34:22,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {19775#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19771#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:34:22,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {19779#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19775#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:34:22,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {19783#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19779#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:34:22,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {19787#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19783#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:34:22,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {19791#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19787#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:34:22,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {19795#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19791#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {19799#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19795#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:34:22,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {19803#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19799#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:34:22,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {19807#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19803#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:34:22,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {19811#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19807#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {19815#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19811#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:34:22,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {19819#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19815#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:34:22,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {19823#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19819#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:34:22,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {19827#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19823#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:34:22,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {19831#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19827#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:34:22,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {19835#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19831#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {19839#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19835#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {19843#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19839#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:34:22,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {19847#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19843#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {19851#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19847#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:34:22,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {19855#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19851#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:34:22,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {19859#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19855#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {19863#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19859#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:34:22,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {19867#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19863#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:34:22,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {19871#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19867#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:34:22,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {19875#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19871#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:34:22,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {19879#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19875#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {19883#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19879#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {19887#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19883#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:34:22,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {19891#(< 43 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {19887#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-28 10:34:22,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {19891#(< 43 ~SIZE~0)} call #t~ret4 := main(); {19891#(< 43 ~SIZE~0)} is VALID [2022-04-28 10:34:22,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19891#(< 43 ~SIZE~0)} {19494#true} #45#return; {19891#(< 43 ~SIZE~0)} is VALID [2022-04-28 10:34:22,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {19891#(< 43 ~SIZE~0)} assume true; {19891#(< 43 ~SIZE~0)} is VALID [2022-04-28 10:34:22,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {19891#(< 43 ~SIZE~0)} is VALID [2022-04-28 10:34:22,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {19494#true} call ULTIMATE.init(); {19494#true} is VALID [2022-04-28 10:34:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044533825] [2022-04-28 10:34:22,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:34:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429632261] [2022-04-28 10:34:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429632261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:22,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:34:22,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2022-04-28 10:34:22,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414743537] [2022-04-28 10:34:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414743537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:22,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:22,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 10:34:22,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595561810] [2022-04-28 10:34:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 10:34:22,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:22,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:22,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 10:34:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 10:34:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 10:34:22,538 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:38,126 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 10:34:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 10:34:38,126 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 10:34:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 10:34:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 10:34:38,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-28 10:34:38,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:38,212 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:34:38,212 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 10:34:38,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 10:34:38,213 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:38,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:34:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 10:34:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 10:34:38,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:38,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,264 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,264 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:38,265 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 10:34:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 10:34:38,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:38,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:38,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 10:34:38,266 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 10:34:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:38,267 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 10:34:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 10:34:38,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:38,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:38,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:38,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-28 10:34:38,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-28 10:34:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:38,269 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-28 10:34:38,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:38,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-28 10:34:38,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 10:34:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 10:34:38,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:38,337 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:38,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:38,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:38,537 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1768766741, now seen corresponding path program 87 times [2022-04-28 10:34:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:38,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908628410] [2022-04-28 10:34:38,540 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:38,541 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1768766741, now seen corresponding path program 88 times [2022-04-28 10:34:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:38,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756228126] [2022-04-28 10:34:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:38,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:34:38,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806336872] [2022-04-28 10:34:38,561 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:34:38,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:38,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:38,562 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:34:38,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 10:34:38,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:34:38,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:38,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:34:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:38,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:40,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {20255#true} call ULTIMATE.init(); {20255#true} is VALID [2022-04-28 10:34:40,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {20255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:40,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {20263#(<= 40000 ~SIZE~0)} assume true; {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:40,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20263#(<= 40000 ~SIZE~0)} {20255#true} #45#return; {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:40,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {20263#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:34:40,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {20263#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {20276#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {20276#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20280#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {20280#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:34:40,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {20284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:34:40,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {20288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:34:40,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {20292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20296#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {20296#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20300#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:34:40,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {20300#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20304#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {20304#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:34:40,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {20308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:34:40,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {20312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20316#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {20316#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:34:40,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {20320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:34:40,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {20324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20328#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {20328#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20332#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {20332#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20336#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {20336#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20340#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {20340#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:34:40,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {20344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20348#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {20348#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:34:40,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {20352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20356#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:34:40,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {20356#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20360#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {20360#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:34:40,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {20364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20368#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:34:40,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {20368#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:34:40,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {20372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:34:40,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {20376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20380#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:34:40,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {20380#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20384#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {20384#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:34:40,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {20388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:34:40,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {20392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20396#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20400#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {20400#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20404#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {20404#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:34:40,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {20408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:34:40,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {20412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:34:40,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {20416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:34:40,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {20420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20424#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:34:40,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {20424#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20428#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {20428#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:34:40,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {20432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20436#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:34:40,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {20436#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20440#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:34:40,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {20440#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20444#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:34:40,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {20444#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:34:40,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {20448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-28 10:34:40,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {20452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !(~i~0 < ~SIZE~0); {20256#false} is VALID [2022-04-28 10:34:40,140 INFO L272 TraceCheckUtils]: 51: Hoare triple {20256#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {20256#false} is VALID [2022-04-28 10:34:40,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {20256#false} ~cond := #in~cond; {20256#false} is VALID [2022-04-28 10:34:40,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {20256#false} assume 0 == ~cond; {20256#false} is VALID [2022-04-28 10:34:40,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {20256#false} assume !false; {20256#false} is VALID [2022-04-28 10:34:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:40,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:35:10,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {20256#false} assume !false; {20256#false} is VALID [2022-04-28 10:35:10,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {20256#false} assume 0 == ~cond; {20256#false} is VALID [2022-04-28 10:35:10,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {20256#false} ~cond := #in~cond; {20256#false} is VALID [2022-04-28 10:35:10,653 INFO L272 TraceCheckUtils]: 51: Hoare triple {20256#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {20256#false} is VALID [2022-04-28 10:35:10,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {20480#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {20256#false} is VALID [2022-04-28 10:35:10,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {20484#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20480#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:35:10,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {20488#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20484#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:35:10,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {20492#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20488#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:35:10,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {20496#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20492#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:35:10,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {20500#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20496#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:35:10,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {20504#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20500#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {20508#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20504#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:35:10,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {20512#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20508#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {20516#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20512#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:35:10,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {20520#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20516#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:35:10,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {20524#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20520#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:35:10,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {20528#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20524#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:35:10,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {20532#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20528#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:35:10,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {20536#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20532#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:35:10,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {20540#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20536#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:35:10,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {20544#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20540#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:35:10,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {20548#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20544#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:35:10,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {20552#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20548#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:35:10,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {20556#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20552#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:35:10,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {20560#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20556#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {20564#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20560#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:35:10,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {20568#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20564#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:35:10,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {20572#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20568#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:35:10,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {20576#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20572#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {20580#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20576#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:35:10,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {20584#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20580#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:35:10,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {20588#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20584#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:35:10,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {20592#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20588#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:35:10,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {20596#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20592#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:35:10,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {20600#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20596#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {20604#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20600#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {20608#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20604#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:35:10,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {20612#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20608#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {20616#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20612#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:35:10,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {20620#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20616#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:35:10,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {20624#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20620#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {20628#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20624#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:35:10,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {20632#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20628#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:35:10,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {20636#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20632#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:35:10,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {20640#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20636#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:35:10,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {20644#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20640#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {20648#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20644#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {20652#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20648#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {20656#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20652#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-28 10:35:10,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {20660#(< 44 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {20656#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:35:10,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {20660#(< 44 ~SIZE~0)} call #t~ret4 := main(); {20660#(< 44 ~SIZE~0)} is VALID [2022-04-28 10:35:10,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20660#(< 44 ~SIZE~0)} {20255#true} #45#return; {20660#(< 44 ~SIZE~0)} is VALID [2022-04-28 10:35:10,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {20660#(< 44 ~SIZE~0)} assume true; {20660#(< 44 ~SIZE~0)} is VALID [2022-04-28 10:35:10,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {20255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {20660#(< 44 ~SIZE~0)} is VALID [2022-04-28 10:35:10,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {20255#true} call ULTIMATE.init(); {20255#true} is VALID [2022-04-28 10:35:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:35:10,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756228126] [2022-04-28 10:35:10,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:35:10,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806336872] [2022-04-28 10:35:10,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806336872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:35:10,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:35:10,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 94 [2022-04-28 10:35:10,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:35:10,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908628410] [2022-04-28 10:35:10,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908628410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:35:10,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:35:10,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 10:35:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121077791] [2022-04-28 10:35:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:35:10,714 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 10:35:10,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:35:10,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:10,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:10,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 10:35:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 10:35:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 10:35:10,760 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:21,347 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 10:35:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 10:35:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 10:35:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:35:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 10:35:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 10:35:21,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-28 10:35:21,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:21,417 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:35:21,417 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:35:21,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 10:35:21,418 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:35:21,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:35:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:35:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 10:35:21,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:35:21,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,461 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,461 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:21,462 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 10:35:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 10:35:21,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:21,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:21,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 10:35:21,462 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 10:35:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:21,463 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 10:35:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 10:35:21,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:21,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:21,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:35:21,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:35:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 10:35:21,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-28 10:35:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:35:21,464 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 10:35:21,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:21,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 10:35:21,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 10:35:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 10:35:21,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:35:21,519 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:35:21,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-28 10:35:21,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 10:35:21,720 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:35:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:35:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1037300946, now seen corresponding path program 89 times [2022-04-28 10:35:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7703603] [2022-04-28 10:35:21,722 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:35:21,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:35:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1037300946, now seen corresponding path program 90 times [2022-04-28 10:35:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:35:21,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979336832] [2022-04-28 10:35:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:35:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:35:21,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:35:21,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131757770] [2022-04-28 10:35:21,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:35:21,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:21,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:35:21,743 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:35:21,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 10:35:21,819 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-28 10:35:21,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:35:21,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:35:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:21,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:35:23,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {21030#true} call ULTIMATE.init(); {21030#true} is VALID [2022-04-28 10:35:23,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {21030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:35:23,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {21038#(<= 40000 ~SIZE~0)} assume true; {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:35:23,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21038#(<= 40000 ~SIZE~0)} {21030#true} #45#return; {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:35:23,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {21038#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:35:23,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {21038#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {21051#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {21051#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21055#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {21055#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:35:23,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {21059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:35:23,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {21063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:35:23,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {21067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21071#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {21071#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21075#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:35:23,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {21075#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21079#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {21079#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:35:23,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {21083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21087#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:35:23,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {21087#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21091#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {21091#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21095#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:35:23,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {21095#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21099#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:35:23,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {21099#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21103#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {21103#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21107#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {21107#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21111#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {21111#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21115#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {21115#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21119#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:35:23,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {21119#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21123#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {21123#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:35:23,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {21127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:35:23,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {21131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21135#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {21135#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:35:23,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {21139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21143#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:35:23,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {21143#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:35:23,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {21147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:35:23,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21155#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:35:23,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {21155#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21159#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {21159#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21163#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:35:23,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {21163#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:35:23,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {21167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21171#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {21171#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21175#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {21175#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21179#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {21179#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:35:23,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {21183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21187#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:35:23,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {21187#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:35:23,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {21191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:35:23,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {21195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21199#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:35:23,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {21199#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21203#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {21203#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:35:23,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {21207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:35:23,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {21211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21215#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:35:23,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {21215#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:35:23,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {21219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:35:23,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {21223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-28 10:35:23,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {21227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-28 10:35:23,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {21231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !(~i~0 < ~SIZE~0); {21031#false} is VALID [2022-04-28 10:35:23,386 INFO L272 TraceCheckUtils]: 52: Hoare triple {21031#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21031#false} is VALID [2022-04-28 10:35:23,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {21031#false} ~cond := #in~cond; {21031#false} is VALID [2022-04-28 10:35:23,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {21031#false} assume 0 == ~cond; {21031#false} is VALID [2022-04-28 10:35:23,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {21031#false} assume !false; {21031#false} is VALID [2022-04-28 10:35:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:23,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:36:00,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {21031#false} assume !false; {21031#false} is VALID [2022-04-28 10:36:00,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {21031#false} assume 0 == ~cond; {21031#false} is VALID [2022-04-28 10:36:00,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {21031#false} ~cond := #in~cond; {21031#false} is VALID [2022-04-28 10:36:00,830 INFO L272 TraceCheckUtils]: 52: Hoare triple {21031#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21031#false} is VALID [2022-04-28 10:36:00,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {21259#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {21031#false} is VALID [2022-04-28 10:36:00,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {21263#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21259#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:36:00,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {21267#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21263#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:36:00,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {21271#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21267#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:36:00,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {21275#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21271#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:36:00,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {21279#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21275#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:36:00,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {21283#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21279#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {21287#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21283#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:36:00,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {21291#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21287#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {21295#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21291#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:36:00,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {21299#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21295#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:36:00,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {21303#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21299#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:36:00,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {21307#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21303#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:36:00,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {21311#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21307#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:36:00,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {21315#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21311#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:36:00,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {21319#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21315#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:36:00,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {21323#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21319#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:36:00,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {21327#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21323#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:36:00,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {21331#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21327#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:36:00,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {21335#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21331#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:36:00,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {21339#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21335#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {21343#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21339#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:36:00,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {21347#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21343#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:36:00,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {21351#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21347#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:36:00,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {21355#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21351#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {21359#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21355#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:36:00,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {21363#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21359#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:36:00,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {21367#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21363#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:36:00,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {21371#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21367#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:36:00,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {21375#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21371#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:36:00,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {21379#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21375#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {21383#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21379#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {21387#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21383#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:36:00,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {21391#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21387#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {21395#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21391#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:36:00,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {21399#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21395#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:36:00,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {21403#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21399#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {21407#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21403#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:36:00,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {21411#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21407#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:36:00,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {21415#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21411#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:36:00,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {21419#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21415#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:36:00,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {21423#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21419#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {21427#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21423#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {21431#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21427#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {21435#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21431#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-28 10:36:00,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {21439#(< (+ main_~i~0 45) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21435#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:36:00,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {21443#(< 45 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {21439#(< (+ main_~i~0 45) ~SIZE~0)} is VALID [2022-04-28 10:36:00,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {21443#(< 45 ~SIZE~0)} call #t~ret4 := main(); {21443#(< 45 ~SIZE~0)} is VALID [2022-04-28 10:36:00,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21443#(< 45 ~SIZE~0)} {21030#true} #45#return; {21443#(< 45 ~SIZE~0)} is VALID [2022-04-28 10:36:00,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {21443#(< 45 ~SIZE~0)} assume true; {21443#(< 45 ~SIZE~0)} is VALID [2022-04-28 10:36:00,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {21030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {21443#(< 45 ~SIZE~0)} is VALID [2022-04-28 10:36:00,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {21030#true} call ULTIMATE.init(); {21030#true} is VALID [2022-04-28 10:36:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:36:00,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979336832] [2022-04-28 10:36:00,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:36:00,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131757770] [2022-04-28 10:36:00,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131757770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:36:00,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:36:00,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2022-04-28 10:36:00,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:36:00,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7703603] [2022-04-28 10:36:00,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7703603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:36:00,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:36:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 10:36:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043901216] [2022-04-28 10:36:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:36:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 10:36:00,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:36:00,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:00,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:00,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 10:36:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 10:36:00,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 10:36:00,961 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:07,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:36:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:16,378 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 10:36:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 10:36:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 10:36:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:36:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 10:36:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 10:36:16,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-28 10:36:16,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:16,453 INFO L225 Difference]: With dead ends: 63 [2022-04-28 10:36:16,453 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 10:36:16,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 10:36:16,454 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:36:16,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 10:36:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 10:36:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 10:36:16,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:36:16,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,499 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,499 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:16,500 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 10:36:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 10:36:16,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:16,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:16,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 10:36:16,500 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 10:36:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:16,501 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 10:36:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 10:36:16,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:16,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:16,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:36:16,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:36:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-28 10:36:16,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-28 10:36:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:36:16,502 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-28 10:36:16,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-28 10:36:16,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 10:36:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 10:36:16,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:36:16,578 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:36:16,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 10:36:16,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:16,778 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:36:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:36:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2126053323, now seen corresponding path program 91 times [2022-04-28 10:36:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:16,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338071482] [2022-04-28 10:36:16,781 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:36:16,782 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:36:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2126053323, now seen corresponding path program 92 times [2022-04-28 10:36:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:36:16,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920658425] [2022-04-28 10:36:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:36:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:36:16,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:36:16,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518949218] [2022-04-28 10:36:16,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:36:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:36:16,805 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:36:16,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 10:36:16,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:36:16,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:36:16,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:36:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:16,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:36:18,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {21819#true} call ULTIMATE.init(); {21819#true} is VALID [2022-04-28 10:36:18,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {21819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:36:18,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {21827#(<= 40000 ~SIZE~0)} assume true; {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:36:18,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21827#(<= 40000 ~SIZE~0)} {21819#true} #45#return; {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:36:18,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {21827#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:36:18,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {21827#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {21840#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {21840#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21844#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {21844#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:36:18,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {21848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21852#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:36:18,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:36:18,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {21856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21860#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {21860#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:36:18,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {21864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21868#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {21868#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:36:18,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {21872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:36:18,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {21876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21880#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {21880#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:36:18,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {21884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:36:18,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {21888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21892#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {21892#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21896#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {21896#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21900#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {21900#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21904#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {21904#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:36:18,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {21908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21912#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {21912#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:36:18,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {21916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:36:18,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {21920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21924#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {21924#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:36:18,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {21928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:36:18,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {21932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:36:18,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {21936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:36:18,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {21940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:36:18,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {21944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21948#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {21948#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:36:18,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {21952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:36:18,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {21956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21960#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {21960#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21964#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {21964#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21968#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {21968#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:36:18,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {21972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:36:18,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {21976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21980#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:36:18,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {21980#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:36:18,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {21984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:36:18,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {21988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21992#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {21992#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:36:18,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {21996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:36:18,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {22000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22004#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:36:18,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {22004#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:36:18,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {22008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:36:18,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {22012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-28 10:36:18,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {22016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-28 10:36:18,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {22020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} is VALID [2022-04-28 10:36:18,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {22024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} assume !(~i~0 < ~SIZE~0); {21820#false} is VALID [2022-04-28 10:36:18,536 INFO L272 TraceCheckUtils]: 53: Hoare triple {21820#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21820#false} is VALID [2022-04-28 10:36:18,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {21820#false} ~cond := #in~cond; {21820#false} is VALID [2022-04-28 10:36:18,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {21820#false} assume 0 == ~cond; {21820#false} is VALID [2022-04-28 10:36:18,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {21820#false} assume !false; {21820#false} is VALID [2022-04-28 10:36:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:18,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:37:14,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {21820#false} assume !false; {21820#false} is VALID [2022-04-28 10:37:14,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {21820#false} assume 0 == ~cond; {21820#false} is VALID [2022-04-28 10:37:14,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {21820#false} ~cond := #in~cond; {21820#false} is VALID [2022-04-28 10:37:14,577 INFO L272 TraceCheckUtils]: 53: Hoare triple {21820#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21820#false} is VALID [2022-04-28 10:37:14,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {22052#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {21820#false} is VALID [2022-04-28 10:37:14,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {22056#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22052#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:37:14,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {22060#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22056#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:37:14,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {22064#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22060#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:37:14,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {22068#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22064#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:37:14,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {22072#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22068#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:37:14,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {22076#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22072#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {22080#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22076#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:37:14,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {22084#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22080#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {22088#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22084#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:37:14,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {22092#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22088#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:37:14,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {22096#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22092#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:37:14,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {22100#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22096#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:37:14,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {22104#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22100#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:37:14,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {22108#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22104#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:37:14,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {22112#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22108#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:37:14,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {22116#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22112#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:37:14,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {22120#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22116#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:37:14,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {22124#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22120#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:37:14,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {22128#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22124#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:37:14,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {22132#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22128#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {22136#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22132#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:37:14,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {22140#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22136#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:37:14,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {22144#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22140#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:37:14,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {22148#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22144#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {22152#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22148#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:37:14,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {22156#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22152#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:37:14,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {22160#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22156#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:37:14,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {22164#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22160#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:37:14,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {22168#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22164#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:37:14,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {22172#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22168#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {22176#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22172#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {22180#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22176#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:37:14,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {22184#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22180#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {22188#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22184#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:37:14,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {22192#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22188#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:37:14,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {22196#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22192#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {22200#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22196#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:37:14,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {22204#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22200#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:37:14,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {22208#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22204#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:37:14,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {22212#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22208#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:37:14,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {22216#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22212#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {22220#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22216#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {22224#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22220#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {22228#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22224#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-28 10:37:14,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {22232#(< (+ main_~i~0 45) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22228#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:37:14,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {22236#(< (+ main_~i~0 46) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22232#(< (+ main_~i~0 45) ~SIZE~0)} is VALID [2022-04-28 10:37:14,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {22240#(< 46 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {22236#(< (+ main_~i~0 46) ~SIZE~0)} is VALID [2022-04-28 10:37:14,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {22240#(< 46 ~SIZE~0)} call #t~ret4 := main(); {22240#(< 46 ~SIZE~0)} is VALID [2022-04-28 10:37:14,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22240#(< 46 ~SIZE~0)} {21819#true} #45#return; {22240#(< 46 ~SIZE~0)} is VALID [2022-04-28 10:37:14,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {22240#(< 46 ~SIZE~0)} assume true; {22240#(< 46 ~SIZE~0)} is VALID [2022-04-28 10:37:14,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {21819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {22240#(< 46 ~SIZE~0)} is VALID [2022-04-28 10:37:14,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {21819#true} call ULTIMATE.init(); {21819#true} is VALID [2022-04-28 10:37:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:14,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:37:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920658425] [2022-04-28 10:37:14,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:37:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518949218] [2022-04-28 10:37:14,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518949218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:37:14,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:37:14,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-04-28 10:37:14,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:37:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338071482] [2022-04-28 10:37:14,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338071482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:37:14,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:37:14,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 10:37:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601629225] [2022-04-28 10:37:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:37:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 10:37:14,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:37:14,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:14,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:14,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 10:37:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:14,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 10:37:14,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4659, Invalid=4847, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 10:37:14,722 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:21,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:37:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:27,839 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 10:37:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 10:37:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 10:37:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:37:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 10:37:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 10:37:27,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 10:37:27,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:27,926 INFO L225 Difference]: With dead ends: 64 [2022-04-28 10:37:27,926 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:37:27,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=4659, Invalid=4847, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 10:37:27,927 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:37:27,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 10:37:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:37:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 10:37:27,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:37:27,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,975 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,975 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:27,976 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 10:37:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 10:37:27,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:27,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:27,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 10:37:27,976 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 10:37:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:27,977 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 10:37:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 10:37:27,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:27,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:27,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:37:27,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:37:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 10:37:27,978 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-28 10:37:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:37:27,979 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 10:37:27,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:27,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 10:37:28,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 10:37:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 10:37:28,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:37:28,058 INFO L195 NwaCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:37:28,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 10:37:28,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:37:28,258 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:37:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:37:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1517638642, now seen corresponding path program 93 times [2022-04-28 10:37:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:28,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2077156030] [2022-04-28 10:37:28,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:37:28,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:37:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1517638642, now seen corresponding path program 94 times [2022-04-28 10:37:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:37:28,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122553952] [2022-04-28 10:37:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:37:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:37:28,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:37:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479365238] [2022-04-28 10:37:28,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:37:28,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:37:28,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:37:28,283 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:37:28,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 10:37:28,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:37:28,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:37:28,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 10:37:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:37:28,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:37:29,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {22622#true} call ULTIMATE.init(); {22622#true} is VALID [2022-04-28 10:37:29,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {22622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:37:29,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {22630#(<= 40000 ~SIZE~0)} assume true; {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:37:29,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22630#(<= 40000 ~SIZE~0)} {22622#true} #45#return; {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:37:29,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {22630#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:37:29,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {22630#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {22643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:29,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {22643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:29,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {22647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:37:29,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {22651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:37:29,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {22655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:37:29,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {22659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:29,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {22663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:37:29,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {22667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:29,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {22671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:37:29,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {22675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:37:29,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {22679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:29,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {22683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:37:29,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {22687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:37:30,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {22691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {22695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {22699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {22703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {22707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:37:30,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {22711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22715#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {22715#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:37:30,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {22719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:37:30,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {22723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22727#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {22727#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22731#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:37:30,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {22731#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22735#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:37:30,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {22735#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22739#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:37:30,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {22739#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:37:30,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {22743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:37:30,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {22747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22751#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {22751#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:37:30,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {22755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:37:30,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {22759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22763#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {22763#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22767#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {22767#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22771#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {22771#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:37:30,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {22775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:37:30,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {22779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22783#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:37:30,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {22783#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:37:30,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {22787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:37:30,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {22791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22795#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {22795#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22799#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:37:30,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {22799#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22803#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:37:30,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {22803#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22807#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {22807#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22811#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:37:30,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {22811#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22815#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:37:30,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {22815#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22819#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-28 10:37:30,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {22819#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22823#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-28 10:37:30,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {22823#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22827#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} is VALID [2022-04-28 10:37:30,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {22827#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22831#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:37:30,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {22831#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {22623#false} is VALID [2022-04-28 10:37:30,061 INFO L272 TraceCheckUtils]: 54: Hoare triple {22623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {22623#false} is VALID [2022-04-28 10:37:30,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#false} ~cond := #in~cond; {22623#false} is VALID [2022-04-28 10:37:30,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#false} assume 0 == ~cond; {22623#false} is VALID [2022-04-28 10:37:30,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#false} assume !false; {22623#false} is VALID [2022-04-28 10:37:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:37:30,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:34,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#false} assume !false; {22623#false} is VALID [2022-04-28 10:38:34,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#false} assume 0 == ~cond; {22623#false} is VALID [2022-04-28 10:38:34,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#false} ~cond := #in~cond; {22623#false} is VALID [2022-04-28 10:38:34,564 INFO L272 TraceCheckUtils]: 54: Hoare triple {22623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {22623#false} is VALID [2022-04-28 10:38:34,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {22859#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {22623#false} is VALID [2022-04-28 10:38:34,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {22863#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22859#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:38:34,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {22867#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22863#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:38:34,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {22871#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22867#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:38:34,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {22875#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22871#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:38:34,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {22879#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22875#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:38:34,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {22883#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22879#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {22887#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22883#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:38:34,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {22891#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22887#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {22895#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22891#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:38:34,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {22899#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22895#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:38:34,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {22903#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22899#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:38:34,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {22907#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22903#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:38:34,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {22911#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22907#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:38:34,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {22915#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22911#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:38:34,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {22919#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22915#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:38:34,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {22923#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22919#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:38:34,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {22927#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22923#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:38:34,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {22931#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22927#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:38:34,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {22935#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22931#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:38:34,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {22939#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22935#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {22943#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22939#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:38:34,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {22947#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22943#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:38:34,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {22951#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22947#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:38:34,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {22955#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22951#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {22959#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22955#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:38:34,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {22963#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22959#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:38:34,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {22967#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22963#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:38:34,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {22971#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22967#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:38:34,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {22975#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22971#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:38:34,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {22979#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22975#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {22983#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22979#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {22987#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22983#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:38:34,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {22991#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22987#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {22995#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22991#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:38:34,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {22999#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22995#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:38:34,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {23003#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22999#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {23007#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23003#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:38:34,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {23011#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23007#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:38:34,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {23015#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23011#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:38:34,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {23019#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23015#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:38:34,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {23023#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23019#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {23027#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23023#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {23031#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23027#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {23035#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23031#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-28 10:38:34,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {23039#(< (+ main_~i~0 45) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23035#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:38:34,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {23043#(< (+ main_~i~0 46) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23039#(< (+ main_~i~0 45) ~SIZE~0)} is VALID [2022-04-28 10:38:34,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {23047#(< (+ main_~i~0 47) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23043#(< (+ main_~i~0 46) ~SIZE~0)} is VALID [2022-04-28 10:38:34,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {23051#(< 47 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {23047#(< (+ main_~i~0 47) ~SIZE~0)} is VALID [2022-04-28 10:38:34,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {23051#(< 47 ~SIZE~0)} call #t~ret4 := main(); {23051#(< 47 ~SIZE~0)} is VALID [2022-04-28 10:38:34,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23051#(< 47 ~SIZE~0)} {22622#true} #45#return; {23051#(< 47 ~SIZE~0)} is VALID [2022-04-28 10:38:34,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {23051#(< 47 ~SIZE~0)} assume true; {23051#(< 47 ~SIZE~0)} is VALID [2022-04-28 10:38:34,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {22622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {23051#(< 47 ~SIZE~0)} is VALID [2022-04-28 10:38:34,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {22622#true} call ULTIMATE.init(); {22622#true} is VALID [2022-04-28 10:38:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:34,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122553952] [2022-04-28 10:38:34,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:38:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479365238] [2022-04-28 10:38:34,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479365238] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:34,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:38:34,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 100 [2022-04-28 10:38:34,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2077156030] [2022-04-28 10:38:34,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2077156030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:34,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:34,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 10:38:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034246126] [2022-04-28 10:38:34,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:34,665 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 10:38:34,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:34,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:34,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:34,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 10:38:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:34,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 10:38:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4854, Invalid=5046, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 10:38:34,738 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:39,518 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 10:38:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 10:38:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 10:38:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 10:38:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 10:38:39,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-28 10:38:39,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:39,604 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:38:39,604 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:38:39,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=4854, Invalid=5046, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 10:38:39,606 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:39,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:38:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:38:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 10:38:39,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:39,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,657 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,657 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:39,658 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 10:38:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 10:38:39,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:39,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:39,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 10:38:39,658 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 10:38:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:39,659 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 10:38:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 10:38:39,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:39,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:39,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:39,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-28 10:38:39,660 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-28 10:38:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:39,660 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-28 10:38:39,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:39,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-28 10:38:39,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 10:38:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 10:38:39,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:39,724 INFO L195 NwaCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:39,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-28 10:38:39,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 10:38:39,924 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -163347285, now seen corresponding path program 95 times [2022-04-28 10:38:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:39,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701523428] [2022-04-28 10:38:39,927 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:39,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -163347285, now seen corresponding path program 96 times [2022-04-28 10:38:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:39,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877143484] [2022-04-28 10:38:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:39,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:38:39,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347577368] [2022-04-28 10:38:39,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:38:39,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:39,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:39,948 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:38:39,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 10:38:40,048 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 10:38:40,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:40,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:38:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:40,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:41,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {23439#true} call ULTIMATE.init(); {23439#true} is VALID [2022-04-28 10:38:41,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {23439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {23447#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:38:41,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {23447#(<= 40000 ~SIZE~0)} assume true; {23447#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:38:41,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23447#(<= 40000 ~SIZE~0)} {23439#true} #45#return; {23447#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:38:41,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {23447#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {23447#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:38:41,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {23447#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {23460#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {23460#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23464#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {23464#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23468#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:38:41,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {23468#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23472#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:38:41,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {23472#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23476#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:38:41,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {23476#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23480#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {23480#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23484#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:38:41,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {23484#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23488#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {23488#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23492#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:38:41,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {23492#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23496#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:38:41,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {23496#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23500#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {23500#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23504#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:38:41,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {23504#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23508#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:38:41,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {23508#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23512#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {23512#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23516#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {23516#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23520#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {23520#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23524#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {23524#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23528#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:38:41,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {23528#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23532#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {23532#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23536#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:38:41,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {23536#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23540#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:38:41,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {23540#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23544#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {23544#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23548#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:38:41,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {23548#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23552#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:38:41,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {23552#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23556#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:38:41,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {23556#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23560#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:38:41,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {23560#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23564#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:38:41,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {23564#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23568#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {23568#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23572#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:38:41,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {23572#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23576#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:38:41,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {23576#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23580#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {23580#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23584#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {23584#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23588#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {23588#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23592#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:38:41,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {23592#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23596#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:38:41,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {23596#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23600#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:38:41,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {23600#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23604#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:38:41,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {23604#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23608#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:38:41,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {23608#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23612#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {23612#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23616#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:38:41,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {23616#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23620#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:38:41,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {23620#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23624#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {23624#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23628#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:38:41,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {23628#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23632#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:38:41,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {23632#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23636#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-28 10:38:41,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {23636#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23640#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-28 10:38:41,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {23640#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23644#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} is VALID [2022-04-28 10:38:41,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {23644#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23648#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:38:41,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {23648#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23652#(and (<= 40000 ~SIZE~0) (<= main_~i~0 48))} is VALID [2022-04-28 10:38:41,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {23652#(and (<= 40000 ~SIZE~0) (<= main_~i~0 48))} assume !(~i~0 < ~SIZE~0); {23440#false} is VALID [2022-04-28 10:38:41,814 INFO L272 TraceCheckUtils]: 55: Hoare triple {23440#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {23440#false} is VALID [2022-04-28 10:38:41,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {23440#false} ~cond := #in~cond; {23440#false} is VALID [2022-04-28 10:38:41,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {23440#false} assume 0 == ~cond; {23440#false} is VALID [2022-04-28 10:38:41,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {23440#false} assume !false; {23440#false} is VALID [2022-04-28 10:38:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:41,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:57,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {23440#false} assume !false; {23440#false} is VALID [2022-04-28 10:39:57,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {23440#false} assume 0 == ~cond; {23440#false} is VALID [2022-04-28 10:39:57,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {23440#false} ~cond := #in~cond; {23440#false} is VALID [2022-04-28 10:39:57,947 INFO L272 TraceCheckUtils]: 55: Hoare triple {23440#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {23440#false} is VALID [2022-04-28 10:39:57,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {23680#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {23440#false} is VALID [2022-04-28 10:39:57,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {23684#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23680#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:39:57,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {23688#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23684#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-28 10:39:57,953 INFO L290 TraceCheckUtils]: 51: Hoare triple {23692#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23688#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-28 10:39:57,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {23696#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23692#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-28 10:39:57,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {23700#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23696#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-28 10:39:57,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {23704#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23700#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {23708#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23704#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-28 10:39:57,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {23712#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23708#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {23716#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23712#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:39:57,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {23720#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23716#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-28 10:39:57,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {23724#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23720#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-28 10:39:57,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {23728#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23724#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-28 10:39:57,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {23732#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23728#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-28 10:39:57,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {23736#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23732#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-28 10:39:57,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {23740#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23736#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-28 10:39:57,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {23744#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23740#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-28 10:39:57,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {23748#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23744#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-28 10:39:57,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {23752#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23748#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-28 10:39:57,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {23756#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23752#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-28 10:39:57,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {23760#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23756#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {23764#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23760#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-28 10:39:57,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {23768#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23764#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-28 10:39:57,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {23772#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23768#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-28 10:39:57,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {23776#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23772#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {23780#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23776#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-28 10:39:57,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {23784#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23780#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-28 10:39:57,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {23788#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23784#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-28 10:39:57,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {23792#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23788#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-28 10:39:57,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {23796#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23792#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-28 10:39:57,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {23800#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23796#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {23804#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23800#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {23808#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23804#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-28 10:39:57,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {23812#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23808#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:57,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {23816#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23812#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-28 10:39:57,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {23820#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23816#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-28 10:39:58,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {23824#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23820#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:58,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {23828#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23824#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-28 10:39:58,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {23832#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23828#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-28 10:39:58,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {23836#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23832#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-28 10:39:58,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {23840#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23836#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-28 10:39:58,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {23844#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23840#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:58,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {23848#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23844#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:58,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {23852#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23848#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:58,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {23856#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23852#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-28 10:39:58,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {23860#(< (+ main_~i~0 45) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23856#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-28 10:39:58,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {23864#(< (+ main_~i~0 46) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23860#(< (+ main_~i~0 45) ~SIZE~0)} is VALID [2022-04-28 10:39:58,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {23868#(< (+ main_~i~0 47) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23864#(< (+ main_~i~0 46) ~SIZE~0)} is VALID [2022-04-28 10:39:58,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {23872#(< (+ main_~i~0 48) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {23868#(< (+ main_~i~0 47) ~SIZE~0)} is VALID [2022-04-28 10:39:58,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {23876#(< 48 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {23872#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-28 10:39:58,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {23876#(< 48 ~SIZE~0)} call #t~ret4 := main(); {23876#(< 48 ~SIZE~0)} is VALID [2022-04-28 10:39:58,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23876#(< 48 ~SIZE~0)} {23439#true} #45#return; {23876#(< 48 ~SIZE~0)} is VALID [2022-04-28 10:39:58,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {23876#(< 48 ~SIZE~0)} assume true; {23876#(< 48 ~SIZE~0)} is VALID [2022-04-28 10:39:58,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {23439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {23876#(< 48 ~SIZE~0)} is VALID [2022-04-28 10:39:58,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {23439#true} call ULTIMATE.init(); {23439#true} is VALID [2022-04-28 10:39:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:58,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877143484] [2022-04-28 10:39:58,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:39:58,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347577368] [2022-04-28 10:39:58,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347577368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:58,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:39:58,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2022-04-28 10:39:58,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:58,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701523428] [2022-04-28 10:39:58,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701523428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:58,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:58,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 10:39:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832311977] [2022-04-28 10:39:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 10:39:58,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:58,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:58,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:58,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 10:39:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 10:39:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5053, Invalid=5249, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 10:39:58,101 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:07,553 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 10:40:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 10:40:07,554 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 10:40:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 10:40:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 10:40:07,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-28 10:40:07,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:07,650 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:40:07,650 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 10:40:07,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2547 ImplicationChecksByTransitivity, 75.1s TimeCoverageRelationStatistics Valid=5053, Invalid=5249, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 10:40:07,651 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:07,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:40:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 10:40:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 10:40:07,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:07,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,707 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,708 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:07,708 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 10:40:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 10:40:07,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:07,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:07,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 10:40:07,709 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 10:40:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:07,710 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 10:40:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 10:40:07,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:07,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:07,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:07,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 10:40:07,711 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-28 10:40:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:07,711 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 10:40:07,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:07,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 10:40:07,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 10:40:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 10:40:07,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:07,781 INFO L195 NwaCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:07,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:07,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 10:40:07,982 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash -734303470, now seen corresponding path program 97 times [2022-04-28 10:40:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:07,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523165368] [2022-04-28 10:40:07,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:07,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash -734303470, now seen corresponding path program 98 times [2022-04-28 10:40:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:07,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425726979] [2022-04-28 10:40:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:08,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:40:08,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964421664] [2022-04-28 10:40:08,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:40:08,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:08,012 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:08,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 10:40:08,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:40:08,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:08,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 10:40:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:08,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:09,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {24270#true} call ULTIMATE.init(); {24270#true} is VALID [2022-04-28 10:40:09,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {24270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {24278#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:40:09,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {24278#(<= 40000 ~SIZE~0)} assume true; {24278#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:40:09,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24278#(<= 40000 ~SIZE~0)} {24270#true} #45#return; {24278#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:40:09,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {24278#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {24278#(<= 40000 ~SIZE~0)} is VALID [2022-04-28 10:40:09,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {24278#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {24291#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {24291#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24295#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {24295#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24299#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-28 10:40:09,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {24299#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-28 10:40:09,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {24303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24307#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-28 10:40:09,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {24307#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24311#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {24311#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24315#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-28 10:40:09,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {24315#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24319#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {24319#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-28 10:40:09,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {24323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-28 10:40:09,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {24327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24331#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {24331#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-28 10:40:09,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {24335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-28 10:40:09,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {24339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24343#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {24343#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24347#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {24347#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24351#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {24351#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24355#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {24355#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-28 10:40:09,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {24359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24363#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {24363#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24367#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-28 10:40:09,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {24367#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24371#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-28 10:40:09,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {24371#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24375#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {24375#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-28 10:40:09,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {24379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-28 10:40:09,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {24383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24387#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-28 10:40:09,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {24387#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-28 10:40:09,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {24391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24395#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-28 10:40:09,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {24395#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24399#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {24399#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24403#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-28 10:40:09,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {24403#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24407#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-28 10:40:09,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {24407#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24411#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {24411#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24415#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {24415#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24419#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {24419#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24423#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-28 10:40:09,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {24423#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24427#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-28 10:40:09,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {24427#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24431#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-28 10:40:09,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {24431#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24435#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-28 10:40:09,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {24435#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24439#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-28 10:40:09,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {24439#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24443#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {24443#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24447#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-28 10:40:09,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {24447#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24451#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-28 10:40:09,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {24451#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24455#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,944 INFO L290 TraceCheckUtils]: 47: Hoare triple {24455#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-28 10:40:09,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {24459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24463#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-28 10:40:09,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {24463#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-28 10:40:09,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {24467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24471#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-28 10:40:09,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {24471#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24475#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} is VALID [2022-04-28 10:40:09,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {24475#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24479#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {24479#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 48))} is VALID [2022-04-28 10:40:09,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {24483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 48))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {24487#(and (<= main_~i~0 49) (<= 40000 ~SIZE~0))} is VALID [2022-04-28 10:40:09,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {24487#(and (<= main_~i~0 49) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {24271#false} is VALID [2022-04-28 10:40:09,972 INFO L272 TraceCheckUtils]: 56: Hoare triple {24271#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {24271#false} is VALID [2022-04-28 10:40:09,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {24271#false} ~cond := #in~cond; {24271#false} is VALID [2022-04-28 10:40:09,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {24271#false} assume 0 == ~cond; {24271#false} is VALID [2022-04-28 10:40:09,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {24271#false} assume !false; {24271#false} is VALID [2022-04-28 10:40:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:09,973 INFO L328 TraceCheckSpWp]: Computing backward predicates...